TSTP Solution File: GRP123-2.003 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP123-2.003 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Mon May 20 20:53:29 EDT 2024
% Result : Unsatisfiable 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 23 unt; 8 nHn; 42 RR)
% Number of literals : 96 ( 0 equ; 50 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 : 60 ( 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/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_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/benchmark/theBenchmark.p',qg1_2) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(c_0_12,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_13,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_14,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_12 ).
cnf(c_0_15,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_16,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_17,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_13 ).
cnf(c_0_18,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_19,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_14,c_0_15]) ).
cnf(c_0_20,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_21,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_22,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_23,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_24,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_25,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
c_0_16 ).
cnf(c_0_26,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,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_19,c_0_20]) ).
cnf(c_0_28,plain,
~ equalish(e_2,e_3),
c_0_21 ).
cnf(c_0_29,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_30,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_22 ).
cnf(c_0_31,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_19,c_0_23]) ).
cnf(c_0_32,plain,
~ equalish(e_1,e_3),
c_0_24 ).
cnf(c_0_33,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_34,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X1,X3)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_35,plain,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_36,plain,
~ equalish(e_3,e_2),
c_0_29 ).
cnf(c_0_37,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_38,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
~ equalish(e_3,e_1),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
( product(e_2,e_3,e_2)
| ~ product(e_2,e_2,X1)
| ~ product(e_1,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,plain,
product(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
product(e_2,e_3,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_18])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP123-2.003 : TPTP v8.2.0. Released v1.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 04:16:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 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/benchmark/theBenchmark.p
% 0.18/0.45 # Version: 3.1.0
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27046 completed with status 0
% 0.18/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # No SInE strategy applied
% 0.18/0.45 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.18/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.45 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 811s (1) cores
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.45 # Starting sh5l with 136s (1) cores
% 0.18/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27052 completed with status 0
% 0.18/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # No SInE strategy applied
% 0.18/0.45 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.18/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.45 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 811s (1) cores
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Unsatisfiable
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 22
% 0.18/0.45 # Removed by relevancy pruning/SinE : 0
% 0.18/0.45 # Initial clauses : 22
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 22
% 0.18/0.45 # Processed clauses : 67
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 2
% 0.18/0.45 # ...remaining for further processing : 65
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 2
% 0.18/0.45 # Backward-rewritten : 3
% 0.18/0.45 # Generated clauses : 76
% 0.18/0.45 # ...of the previous two non-redundant : 64
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 75
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Disequality decompositions : 0
% 0.18/0.45 # Total rewrite steps : 13
% 0.18/0.45 # ...of those cached : 6
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 37
% 0.18/0.45 # Positive orientable unit clauses : 12
% 0.18/0.45 # Positive unorientable unit clauses: 0
% 0.18/0.45 # Negative unit clauses : 8
% 0.18/0.45 # Non-unit-clauses : 17
% 0.18/0.45 # Current number of unprocessed clauses: 36
% 0.18/0.45 # ...number of literals in the above : 136
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 28
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 171
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 153
% 0.18/0.45 # Non-unit clause-clause subsumptions : 4
% 0.18/0.45 # Unit Clause-clause subsumption calls : 23
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 13
% 0.18/0.45 # BW rewrite match successes : 2
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 1558
% 0.18/0.45 # Search garbage collected termcells : 53
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.004 s
% 0.18/0.45 # System time : 0.002 s
% 0.18/0.45 # Total time : 0.006 s
% 0.18/0.45 # Maximum resident set size: 1644 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.022 s
% 0.18/0.45 # System time : 0.005 s
% 0.18/0.45 # Total time : 0.027 s
% 0.18/0.45 # Maximum resident set size: 1700 pages
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------