TSTP Solution File: GRP123-7.003 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP123-7.003 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:31 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 26 unt; 8 nHn; 46 RR)
% Number of literals : 99 ( 0 equ; 48 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product1_total_function1,axiom,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_total_function1) ).
cnf(product1_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(product1_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
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(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(product2_total_function2,axiom,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(qg1a,negated_conjecture,
( product2(X4,X1,X2)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg1a) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_idempotence) ).
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(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(c_0_14,plain,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product1_total_function1]) ).
cnf(c_0_15,plain,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product1_right_cancellation]) ).
cnf(c_0_16,plain,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_14 ).
cnf(c_0_17,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_18,plain,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product1_left_cancellation]) ).
cnf(c_0_19,plain,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
c_0_15 ).
cnf(c_0_20,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_21,plain,
( product1(X1,e_3,e_3)
| product1(X1,e_3,e_2)
| product1(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_23,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_24,plain,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
c_0_18 ).
cnf(c_0_25,plain,
( equalish(X1,X2)
| ~ product1(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( product1(e_1,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
~ equalish(e_3,e_1),
c_0_23 ).
cnf(c_0_28,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_29,plain,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_30,negated_conjecture,
( product2(X4,X1,X2)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X2,X4) ),
inference(fof_simplification,[status(thm)],[qg1a]) ).
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ product1(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,plain,
( product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
~ equalish(e_1,e_3),
c_0_28 ).
cnf(c_0_34,plain,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
c_0_29 ).
cnf(c_0_35,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_36,negated_conjecture,
( product2(X4,X1,X2)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X2,X4) ),
c_0_30 ).
cnf(c_0_37,plain,
product1(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_39,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_40,plain,
( equalish(X1,X2)
| ~ product2(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( product2(e_2,X1,e_3)
| ~ product1(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
~ equalish(e_3,e_2),
c_0_38 ).
cnf(c_0_43,plain,
( product1(e_2,e_3,e_1)
| product1(e_2,e_3,e_2)
| product1(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ product1(e_2,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_46,plain,
( product1(e_2,e_3,e_3)
| product1(e_2,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
~ equalish(e_2,e_3),
c_0_45 ).
cnf(c_0_48,plain,
product1(e_2,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_46]),c_0_47]) ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_48]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP123-7.003 : TPTP v8.2.0. Released v1.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 04:38:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 20809 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 20814 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 26
% 0.20/0.52 # Removed by relevancy pruning/SinE : 6
% 0.20/0.52 # Initial clauses : 20
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 20
% 0.20/0.52 # Processed clauses : 71
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 2
% 0.20/0.52 # ...remaining for further processing : 69
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 1
% 0.20/0.52 # Backward-rewritten : 2
% 0.20/0.52 # Generated clauses : 90
% 0.20/0.52 # ...of the previous two non-redundant : 71
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 89
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 29
% 0.20/0.52 # ...of those cached : 19
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 45
% 0.20/0.52 # Positive orientable unit clauses : 8
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 8
% 0.20/0.52 # Non-unit-clauses : 29
% 0.20/0.52 # Current number of unprocessed clauses: 35
% 0.20/0.52 # ...number of literals in the above : 140
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 24
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 187
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 156
% 0.20/0.52 # Non-unit clause-clause subsumptions : 3
% 0.20/0.52 # Unit Clause-clause subsumption calls : 13
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 12
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1608
% 0.20/0.52 # Search garbage collected termcells : 70
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.007 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.011 s
% 0.20/0.52 # Maximum resident set size: 1596 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.008 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.016 s
% 0.20/0.52 # Maximum resident set size: 1700 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------