TSTP Solution File: GRP123-3.003 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP123-3.003 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:45:25 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 20 unt; 6 nHn; 34 RR)
% Number of literals : 73 ( 0 equ; 37 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 44 ( 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.6fRfBUwIvt/E---3.1_27609.p',product_total_function1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',element_3) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',product_left_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',product_idempotence) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',element_2) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',product_right_cancellation) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',e_2_is_not_e_3) ).
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/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',qg1_2) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',e_3_is_not_e_2) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',element_1) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',e_1_is_not_e_3) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p',e_3_is_not_e_1) ).
cnf(c_0_12,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_13,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_14,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_15,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_16,plain,
( product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_18,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_19,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,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_16,c_0_17]) ).
cnf(c_0_21,axiom,
~ equalish(e_2,e_3),
e_2_is_not_e_3 ).
cnf(c_0_22,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
qg1_2 ).
cnf(c_0_23,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,axiom,
~ equalish(e_3,e_2),
e_3_is_not_e_2 ).
cnf(c_0_26,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X1,X3)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_27,plain,
product(e_2,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ product(e_2,e_2,X1)
| ~ product(e_1,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_29,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_30,negated_conjecture,
~ product(e_1,e_3,e_2),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_31,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_30]) ).
cnf(c_0_32,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_33,plain,
product(e_1,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_32]) ).
cnf(c_0_34,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GRP123-3.003 : TPTP v8.1.2. Released v1.2.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.13/0.37 % Computer : n019.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 2400
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Tue Oct 3 02:31:36 EDT 2023
% 0.13/0.37 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.6fRfBUwIvt/E---3.1_27609.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_1 with pid 27688 completed with status 0
% 0.21/0.54 # Result found by new_bool_1
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.54 # H----_011_C07_F1_PI_AE_OS_S1U with pid 27691 completed with status 0
% 0.21/0.54 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 32
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 32
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 32
% 0.21/0.54 # Processed clauses : 66
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 1
% 0.21/0.54 # ...remaining for further processing : 65
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 1
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 89
% 0.21/0.54 # ...of the previous two non-redundant : 69
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 89
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 17
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 62
% 0.21/0.54 # Positive orientable unit clauses : 17
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 7
% 0.21/0.54 # Non-unit-clauses : 38
% 0.21/0.54 # Current number of unprocessed clauses: 28
% 0.21/0.54 # ...number of literals in the above : 119
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 3
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 106
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 57
% 0.21/0.54 # Non-unit clause-clause subsumptions : 2
% 0.21/0.54 # Unit Clause-clause subsumption calls : 42
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 14
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 1941
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.005 s
% 0.21/0.54 # System time : 0.001 s
% 0.21/0.54 # Total time : 0.006 s
% 0.21/0.54 # Maximum resident set size: 1620 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.006 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.009 s
% 0.21/0.54 # Maximum resident set size: 1692 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------