TSTP Solution File: GRP125-4.003 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP125-4.003 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:38:11 EDT 2023
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 20 unt; 7 nHn; 38 RR)
% Number of literals : 78 ( 0 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',product_total_function1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',element_3) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',product_right_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',product_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',element_1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',product_left_cancellation) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',e_3_is_not_e_1) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',e_1_is_not_e_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',element_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',e_2_is_not_e_1) ).
cnf(qg3_2,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X2)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',qg3_2) ).
cnf(qg3_1,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X1)
| ~ product(X2,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',qg3_1) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p',e_2_is_not_e_3) ).
cnf(c_0_13,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_14,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_15,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_16,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_17,plain,
( product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_19,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_20,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_23,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_24,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_26,plain,
product(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_28,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_29,plain,
( equalish(X1,e_1)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X2)
| ~ product(X2,X1,X4) ),
qg3_2 ).
cnf(c_0_31,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_32,plain,
~ product(e_2,e_3,e_2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X3,X4,X1)
| ~ product(X2,X1,X4) ),
qg3_1 ).
cnf(c_0_34,negated_conjecture,
( product(X1,e_2,e_3)
| ~ product(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_35,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( product(X1,X2,X1)
| ~ product(X2,X1,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_37,negated_conjecture,
product(e_3,e_2,e_3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_38,axiom,
~ equalish(e_2,e_3),
e_2_is_not_e_3 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP125-4.003 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:10:39 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.OmFT0YZXr4/E---3.1_20109.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20187 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting sh5l with 136s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20192 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 19
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 19
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 19
% 0.16/0.44 # Processed clauses : 67
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 67
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 1
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 83
% 0.16/0.44 # ...of the previous two non-redundant : 71
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 82
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 10
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 45
% 0.16/0.44 # Positive orientable unit clauses : 7
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 12
% 0.16/0.44 # Non-unit-clauses : 26
% 0.16/0.44 # Current number of unprocessed clauses: 32
% 0.16/0.44 # ...number of literals in the above : 114
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 22
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 176
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 154
% 0.16/0.44 # Non-unit clause-clause subsumptions : 2
% 0.16/0.44 # Unit Clause-clause subsumption calls : 19
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 9
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 1444
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.004 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.006 s
% 0.16/0.44 # Maximum resident set size: 1640 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.024 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.026 s
% 0.16/0.44 # Maximum resident set size: 1680 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------