TSTP Solution File: GRP123-1.003 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP123-1.003 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:45:38 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 24 unt; 8 nHn; 43 RR)
% Number of literals : 96 ( 0 equ; 51 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/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
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/benchmark/theBenchmark.p',qg1_2) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
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(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_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,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_17,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,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_1),
element_1 ).
cnf(c_0_21,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
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) ),
inference(fof_simplification,[status(thm)],[qg1_2]) ).
cnf(c_0_23,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_16 ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,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_20]) ).
cnf(c_0_26,plain,
~ equalish(e_3,e_1),
c_0_21 ).
cnf(c_0_27,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_28,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
c_0_22 ).
cnf(c_0_29,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_30,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_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
~ equalish(e_1,e_3),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X1,X3)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_33,plain,
product(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_35,negated_conjecture,
( ~ product(e_1,e_1,X1)
| ~ product(e_2,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]) ).
cnf(c_0_36,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_34]) ).
cnf(c_0_37,negated_conjecture,
~ product(e_2,e_3,e_1),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_38,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_39,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
~ equalish(e_2,e_3),
c_0_38 ).
cnf(c_0_41,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_42,plain,
product(e_2,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
~ equalish(e_3,e_2),
c_0_41 ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP123-1.003 : TPTP v8.2.0. Released v1.2.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 04:09:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4636 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 # Starting sh5l with 136s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 4641 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 16
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 16
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 16
% 0.14/0.41 # Processed clauses : 51
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 1
% 0.14/0.41 # ...remaining for further processing : 50
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 2
% 0.14/0.41 # Backward-rewritten : 2
% 0.14/0.41 # Generated clauses : 73
% 0.14/0.41 # ...of the previous two non-redundant : 62
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 72
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 11
% 0.14/0.41 # ...of those cached : 4
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 29
% 0.14/0.41 # Positive orientable unit clauses : 7
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 7
% 0.14/0.41 # Non-unit-clauses : 15
% 0.14/0.41 # Current number of unprocessed clauses: 38
% 0.14/0.41 # ...number of literals in the above : 141
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 21
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 164
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 142
% 0.14/0.41 # Non-unit clause-clause subsumptions : 3
% 0.14/0.41 # Unit Clause-clause subsumption calls : 20
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 14
% 0.14/0.41 # BW rewrite match successes : 2
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 1440
% 0.14/0.41 # Search garbage collected termcells : 45
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.005 s
% 0.14/0.41 # Maximum resident set size: 1644 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.018 s
% 0.14/0.41 # System time : 0.005 s
% 0.14/0.41 # Total time : 0.022 s
% 0.14/0.41 # Maximum resident set size: 1700 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------