TSTP Solution File: GRP047-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP047-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:36:15 EDT 2023
% Result : Unsatisfiable 1.35s 0.63s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 21 unt; 0 nHn; 33 RR)
% Number of literals : 79 ( 0 equ; 39 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_substitution3,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',product_substitution3) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',left_identity) ).
cnf(total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',total_function2) ).
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',associativity1) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',left_inverse) ).
cnf(a_equals_b,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',a_equals_b) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',total_function1) ).
cnf(prove_multiply_substitution2,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
file('/export/starexec/sandbox2/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p',prove_multiply_substitution2) ).
cnf(c_0_8,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
product_substitution3 ).
cnf(c_0_9,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_10,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_11,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
associativity1 ).
cnf(c_0_12,plain,
( product(identity,X1,X2)
| ~ equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( equalish(X1,X2)
| ~ product(identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_15,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_16,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ product(identity,X3,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,hypothesis,
equalish(a,b),
a_equals_b ).
cnf(c_0_19,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_20,plain,
( equalish(X1,identity)
| ~ product(inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_21,plain,
( product(inverse(X1),X2,X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,plain,
( equalish(X1,X2)
| ~ equalish(X3,X2)
| ~ equalish(X3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_23,hypothesis,
equalish(b,a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
equalish(multiply(identity,X1),X1),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_25,plain,
( equalish(X1,identity)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
( equalish(X1,a)
| ~ equalish(b,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
equalish(X1,multiply(identity,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_28,plain,
( equalish(X1,identity)
| ~ product(X2,inverse(X2),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,plain,
( equalish(X1,multiply(X2,X3))
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_30,plain,
( product(X1,X2,X3)
| ~ equalish(multiply(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_31,hypothesis,
equalish(multiply(identity,b),a),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
equalish(multiply(X1,inverse(X1)),identity),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
~ equalish(multiply(c,a),multiply(c,b)),
prove_multiply_substitution2 ).
cnf(c_0_34,plain,
( equalish(multiply(X1,X2),X3)
| ~ product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_35,plain,
( product(X1,X2,multiply(X3,X4))
| ~ product(X5,X4,X2)
| ~ product(X1,X5,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_36,hypothesis,
product(identity,b,a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ product(c,a,multiply(c,b)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
( product(X1,a,multiply(X2,b))
| ~ product(X1,identity,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( product(X1,X2,X3)
| ~ product(inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
~ product(c,identity,c),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
product(X1,identity,X1),
inference(spm,[status(thm)],[c_0_40,c_0_14]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP047-2 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:24:08 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.fL8dd8fWpc/E---3.1_22459.p
% 1.35/0.63 # Version: 3.1pre001
% 1.35/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.35/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.35/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.35/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.35/0.63 # Starting sh5l with 300s (1) cores
% 1.35/0.63 # sh5l with pid 22540 completed with status 0
% 1.35/0.63 # Result found by sh5l
% 1.35/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.35/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.35/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.35/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.35/0.63 # Starting sh5l with 300s (1) cores
% 1.35/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.35/0.63 # Search class: FHUNS-FFSF21-SFFFFFNN
% 1.35/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.35/0.63 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.35/0.63 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 22547 completed with status 0
% 1.35/0.63 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 1.35/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.35/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.35/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.35/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.35/0.63 # Starting sh5l with 300s (1) cores
% 1.35/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.35/0.63 # Search class: FHUNS-FFSF21-SFFFFFNN
% 1.35/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.35/0.63 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.35/0.63 # Preprocessing time : 0.001 s
% 1.35/0.63 # Presaturation interreduction done
% 1.35/0.63
% 1.35/0.63 # Proof found!
% 1.35/0.63 # SZS status Unsatisfiable
% 1.35/0.63 # SZS output start CNFRefutation
% See solution above
% 1.35/0.63 # Parsed axioms : 9
% 1.35/0.63 # Removed by relevancy pruning/SinE : 0
% 1.35/0.63 # Initial clauses : 9
% 1.35/0.63 # Removed in clause preprocessing : 0
% 1.35/0.63 # Initial clauses in saturation : 9
% 1.35/0.63 # Processed clauses : 2575
% 1.35/0.63 # ...of these trivial : 43
% 1.35/0.63 # ...subsumed : 1853
% 1.35/0.63 # ...remaining for further processing : 679
% 1.35/0.63 # Other redundant clauses eliminated : 0
% 1.35/0.63 # Clauses deleted for lack of memory : 0
% 1.35/0.63 # Backward-subsumed : 34
% 1.35/0.63 # Backward-rewritten : 11
% 1.35/0.63 # Generated clauses : 15050
% 1.35/0.63 # ...of the previous two non-redundant : 11808
% 1.35/0.63 # ...aggressively subsumed : 0
% 1.35/0.63 # Contextual simplify-reflections : 2
% 1.35/0.63 # Paramodulations : 15050
% 1.35/0.63 # Factorizations : 0
% 1.35/0.63 # NegExts : 0
% 1.35/0.63 # Equation resolutions : 0
% 1.35/0.63 # Total rewrite steps : 5746
% 1.35/0.63 # Propositional unsat checks : 0
% 1.35/0.63 # Propositional check models : 0
% 1.35/0.63 # Propositional check unsatisfiable : 0
% 1.35/0.63 # Propositional clauses : 0
% 1.35/0.63 # Propositional clauses after purity: 0
% 1.35/0.63 # Propositional unsat core size : 0
% 1.35/0.63 # Propositional preprocessing time : 0.000
% 1.35/0.63 # Propositional encoding time : 0.000
% 1.35/0.63 # Propositional solver time : 0.000
% 1.35/0.63 # Success case prop preproc time : 0.000
% 1.35/0.63 # Success case prop encoding time : 0.000
% 1.35/0.63 # Success case prop solver time : 0.000
% 1.35/0.63 # Current number of processed clauses : 625
% 1.35/0.63 # Positive orientable unit clauses : 63
% 1.35/0.63 # Positive unorientable unit clauses: 0
% 1.35/0.63 # Negative unit clauses : 5
% 1.35/0.63 # Non-unit-clauses : 557
% 1.35/0.63 # Current number of unprocessed clauses: 9221
% 1.35/0.63 # ...number of literals in the above : 24602
% 1.35/0.63 # Current number of archived formulas : 0
% 1.35/0.63 # Current number of archived clauses : 54
% 1.35/0.63 # Clause-clause subsumption calls (NU) : 36197
% 1.35/0.63 # Rec. Clause-clause subsumption calls : 34413
% 1.35/0.63 # Non-unit clause-clause subsumptions : 1873
% 1.35/0.63 # Unit Clause-clause subsumption calls : 120
% 1.35/0.63 # Rewrite failures with RHS unbound : 0
% 1.35/0.63 # BW rewrite match attempts : 195
% 1.35/0.63 # BW rewrite match successes : 11
% 1.35/0.63 # Condensation attempts : 0
% 1.35/0.63 # Condensation successes : 0
% 1.35/0.63 # Termbank termtop insertions : 158598
% 1.35/0.63
% 1.35/0.63 # -------------------------------------------------
% 1.35/0.63 # User time : 0.172 s
% 1.35/0.63 # System time : 0.008 s
% 1.35/0.63 # Total time : 0.180 s
% 1.35/0.63 # Maximum resident set size: 1648 pages
% 1.35/0.63
% 1.35/0.63 # -------------------------------------------------
% 1.35/0.63 # User time : 0.172 s
% 1.35/0.63 # System time : 0.011 s
% 1.35/0.63 # Total time : 0.182 s
% 1.35/0.63 # Maximum resident set size: 1676 pages
% 1.35/0.63 % E---3.1 exiting
% 1.35/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------