TSTP Solution File: GRP131-2.002 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP131-2.002 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:49:53 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 13 unt; 21 nHn; 44 RR)
% Number of literals : 112 ( 0 equ; 53 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',product_total_function1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',element_2) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',element_1) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',product_right_cancellation) ).
cnf(qg1_2,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',qg1_2) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',product_left_cancellation) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p',e_2_is_not_e_1) ).
cnf(c_0_8,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_9,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_11,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_12,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_13,plain,
( product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
inference(fof_simplification,[status(thm)],[qg1_2]) ).
cnf(c_0_15,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_16,plain,
( product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_17,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_12 ).
cnf(c_0_18,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_19,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_20,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
c_0_14 ).
cnf(c_0_21,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_22,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_15 ).
cnf(c_0_23,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_24,plain,
( equalish(X1,e_2)
| product(e_1,e_2,e_1)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_26,plain,
~ equalish(e_1,e_2),
c_0_19 ).
cnf(c_0_27,negated_conjecture,
( equalish(X1,e_2)
| product(e_2,e_2,e_1)
| ~ product(e_2,e_2,X2)
| ~ product(e_2,X1,X3)
| ~ product(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( equalish(X1,e_2)
| product(e_2,e_1,e_1)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( equalish(X1,e_2)
| product(e_2,e_2,e_1)
| ~ product(e_2,X1,X2)
| ~ product(X2,X1,e_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_31,plain,
( product(e_1,e_1,e_1)
| product(e_2,e_1,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_33,plain,
( equalish(X1,e_2)
| product(e_2,e_2,e_1)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_34,plain,
( equalish(X1,e_1)
| product(e_1,e_1,e_1)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( product(e_1,e_1,e_1)
| product(e_2,e_2,e_1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_25]) ).
cnf(c_0_36,plain,
~ equalish(e_2,e_1),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( equalish(X1,e_2)
| product(e_1,e_2,e_1)
| ~ product(e_2,e_2,X2)
| ~ product(e_1,X1,X3)
| ~ product(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_38,plain,
( product(e_1,e_2,e_1)
| product(e_2,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_18]),c_0_26]) ).
cnf(c_0_39,negated_conjecture,
product(e_1,e_1,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( equalish(X1,e_2)
| product(e_1,e_2,e_1)
| ~ product(e_1,X1,X2)
| ~ product(X2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( equalish(X1,e_1)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
product(e_1,e_2,e_1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_39])]),c_0_26]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP131-2.002 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 15:58:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.USthU9zw5k/E---3.1_28072.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28179 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.52 # Starting sh5l with 136s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28185 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 13
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 13
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 13
% 0.21/0.52 # Processed clauses : 133
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 43
% 0.21/0.52 # ...remaining for further processing : 90
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 46
% 0.21/0.52 # Generated clauses : 171
% 0.21/0.52 # ...of the previous two non-redundant : 169
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 1
% 0.21/0.52 # Paramodulations : 171
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 48
% 0.21/0.52 # ...of those cached : 45
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 31
% 0.21/0.52 # Positive orientable unit clauses : 7
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 21
% 0.21/0.52 # Current number of unprocessed clauses: 59
% 0.21/0.52 # ...number of literals in the above : 228
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 59
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 759
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 491
% 0.21/0.52 # Non-unit clause-clause subsumptions : 44
% 0.21/0.52 # Unit Clause-clause subsumption calls : 30
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 10
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3087
% 0.21/0.52 # Search garbage collected termcells : 45
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1660 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.041 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.048 s
% 0.21/0.52 # Maximum resident set size: 1696 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------