TSTP Solution File: GRP131-1.002 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP131-1.002 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:46:33 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of clauses : 52 ( 14 unt; 19 nHn; 52 RR)
% Number of literals : 128 ( 0 equ; 66 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
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(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
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(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(qg1_1,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg1_1) ).
cnf(c_0_8,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_9,plain,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_11,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_12,plain,
( product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_14,plain,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
c_0_11 ).
cnf(c_0_15,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_17,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_18,plain,
~ equalish(e_2,e_1),
c_0_13 ).
cnf(c_0_19,plain,
( product(e_1,e_1,e_2)
| equalish(X1,e_1)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_21,plain,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
c_0_17 ).
cnf(c_0_22,plain,
( product(e_1,e_1,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_24,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_25,plain,
( equalish(X1,e_1)
| ~ product(e_1,e_2,e_1)
| ~ product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
inference(fof_simplification,[status(thm)],[qg1_1]) ).
cnf(c_0_27,plain,
~ equalish(e_1,e_2),
c_0_23 ).
cnf(c_0_28,plain,
( product(e_2,e_2,e_2)
| equalish(X1,e_2)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_29,plain,
( ~ product(e_1,e_2,e_1)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_30,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X1)
| ~ product(X6,X5,X4) ),
c_0_26 ).
cnf(c_0_32,plain,
( product(e_2,e_2,e_2)
| ~ product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( product(e_2,e_2,e_2)
| equalish(X1,e_2)
| ~ product(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_34,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_35,plain,
( product(e_1,e_2,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( product(e_2,e_2,e_2)
| equalish(X1,e_1)
| ~ product(e_1,e_2,X2)
| ~ product(e_2,X3,X1)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_37,plain,
( product(e_1,e_2,e_2)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_38,plain,
( product(e_2,e_2,e_2)
| ~ product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_39,plain,
( product(e_2,e_1,e_2)
| equalish(X1,e_2)
| ~ product(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_40,plain,
( equalish(X1,e_1)
| ~ product(e_2,e_1,e_2)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( product(e_2,e_2,e_2)
| equalish(X1,e_1)
| ~ product(e_2,X2,X1)
| ~ product(X1,X2,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_43,plain,
( product(e_2,e_1,e_2)
| ~ product(e_1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_44,plain,
( ~ product(e_2,e_1,e_2)
| ~ product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
product(e_2,e_2,e_2),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18]),c_0_42]) ).
cnf(c_0_46,plain,
( product(e_1,e_1,e_2)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_43,c_0_15]) ).
cnf(c_0_47,plain,
~ product(e_2,e_1,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
( product(e_2,e_1,e_2)
| equalish(X1,e_1)
| ~ product(e_1,e_1,X2)
| ~ product(e_2,X3,X1)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_49,plain,
product(e_1,e_1,e_2),
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( equalish(X1,e_1)
| ~ product(e_2,X2,X1)
| ~ product(X1,X2,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_45])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP131-1.002 : TPTP v8.2.0. Released v1.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n021.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 05:59:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 9497 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 9500 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 10
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 10
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 10
% 0.20/0.51 # Processed clauses : 174
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 49
% 0.20/0.51 # ...remaining for further processing : 124
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 37
% 0.20/0.51 # Backward-rewritten : 36
% 0.20/0.51 # Generated clauses : 228
% 0.20/0.51 # ...of the previous two non-redundant : 223
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 225
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 38
% 0.20/0.51 # ...of those cached : 34
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 38
% 0.20/0.51 # Positive orientable unit clauses : 6
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 6
% 0.20/0.51 # Non-unit-clauses : 26
% 0.20/0.51 # Current number of unprocessed clauses: 11
% 0.20/0.51 # ...number of literals in the above : 40
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 86
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1073
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 832
% 0.20/0.51 # Non-unit clause-clause subsumptions : 50
% 0.20/0.51 # Unit Clause-clause subsumption calls : 117
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 14
% 0.20/0.51 # BW rewrite match successes : 4
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3473
% 0.20/0.51 # Search garbage collected termcells : 37
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 1692 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1696 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------