TSTP Solution File: GRP402-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP402-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:47:51 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 20 unt; 0 nHn; 15 RR)
% Number of literals : 40 ( 39 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_cancellation,axiom,
( X2 = X3
| multiply(X1,X2) != multiply(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP008-1.ax',left_cancellation) ).
cnf(commutator,axiom,
multiply(X1,X2) = multiply(X2,multiply(X1,commutator(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutator) ).
cnf(associativity_of_multiply,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply) ).
cnf(nilpotency,axiom,
multiply(commutator(X1,X2),X3) = multiply(X3,commutator(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nilpotency) ).
cnf(prove_commutator_is_associative,negated_conjecture,
commutator(commutator(a,b),c) != commutator(a,commutator(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutator_is_associative) ).
cnf(c_0_5,plain,
( X2 = X3
| multiply(X1,X2) != multiply(X1,X3) ),
inference(fof_simplification,[status(thm)],[left_cancellation]) ).
cnf(c_0_6,plain,
( X2 = X3
| multiply(X1,X2) != multiply(X1,X3) ),
c_0_5 ).
cnf(c_0_7,axiom,
multiply(X1,X2) = multiply(X2,multiply(X1,commutator(X1,X2))),
commutator ).
cnf(c_0_8,plain,
( X1 = multiply(X2,commutator(X2,X3))
| multiply(X3,X1) != multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity_of_multiply ).
cnf(c_0_10,plain,
multiply(X1,commutator(X1,X1)) = X1,
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_11,axiom,
multiply(commutator(X1,X2),X3) = multiply(X3,commutator(X1,X2)),
nilpotency ).
cnf(c_0_12,plain,
( X1 = X2
| multiply(X3,multiply(X4,X1)) != multiply(X3,multiply(X4,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_9]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(commutator(X1,X1),X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| multiply(commutator(X3,X4),X1) != multiply(X2,commutator(X3,X4)) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
( X1 = commutator(X2,X2)
| multiply(X3,multiply(X2,X1)) != multiply(X3,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(X2,commutator(X1,X1))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_17,plain,
( multiply(X1,commutator(X1,commutator(X2,X3))) = X4
| multiply(X1,commutator(X2,X3)) != multiply(X4,commutator(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_18,plain,
commutator(X1,X1) = commutator(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
commutator(commutator(a,b),c) != commutator(a,commutator(b,c)),
inference(fof_simplification,[status(thm)],[prove_commutator_is_associative]) ).
cnf(c_0_20,plain,
multiply(X1,commutator(X1,commutator(X2,X3))) = X1,
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( X1 = commutator(X2,X3)
| multiply(X3,multiply(X2,X1)) != multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_22,plain,
multiply(X1,commutator(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
commutator(commutator(a,b),c) != commutator(a,commutator(b,c)),
c_0_19 ).
cnf(c_0_24,plain,
commutator(X1,commutator(X2,X3)) = commutator(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_25,plain,
( X1 = commutator(commutator(X2,X3),X4)
| multiply(X4,multiply(X1,commutator(X2,X3))) != multiply(commutator(X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_26,plain,
multiply(commutator(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
commutator(commutator(a,b),c) != commutator(a,a),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
commutator(X1,X1) = commutator(commutator(X2,X3),X4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP402-1 : TPTP v8.2.0. Released v2.5.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n007.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun May 19 04:34:37 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 26761 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.21/0.54 # H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 26767 completed with status 0
% 0.21/0.54 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUPS-FFSF22-MFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 178s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 6
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 6
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 6
% 0.21/0.54 # Processed clauses : 757
% 0.21/0.54 # ...of these trivial : 35
% 0.21/0.54 # ...subsumed : 607
% 0.21/0.54 # ...remaining for further processing : 115
% 0.21/0.54 # Other redundant clauses eliminated : 19
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 10
% 0.21/0.54 # Backward-rewritten : 28
% 0.21/0.54 # Generated clauses : 5449
% 0.21/0.54 # ...of the previous two non-redundant : 3808
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 5406
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 42
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 4130
% 0.21/0.54 # ...of those cached : 3010
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 70
% 0.21/0.54 # Positive orientable unit clauses : 15
% 0.21/0.54 # Positive unorientable unit clauses: 9
% 0.21/0.54 # Negative unit clauses : 0
% 0.21/0.54 # Non-unit-clauses : 46
% 0.21/0.54 # Current number of unprocessed clauses: 2907
% 0.21/0.54 # ...number of literals in the above : 4997
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 45
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1168
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1168
% 0.21/0.54 # Non-unit clause-clause subsumptions : 343
% 0.21/0.54 # Unit Clause-clause subsumption calls : 96
% 0.21/0.54 # Rewrite failures with RHS unbound : 343
% 0.21/0.54 # BW rewrite match attempts : 389
% 0.21/0.54 # BW rewrite match successes : 124
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 36337
% 0.21/0.54 # Search garbage collected termcells : 8
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.043 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.049 s
% 0.21/0.54 # Maximum resident set size: 1636 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.046 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.052 s
% 0.21/0.54 # Maximum resident set size: 1696 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------