TSTP Solution File: GRP087-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP087-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Sat May 4 07:48:48 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 24 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 33 ( 32 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
file('/export/starexec/sandbox2/tmp/tmp.lmWfwneyK9/E---3.1_3700.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/tmp/tmp.lmWfwneyK9/E---3.1_3700.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(inverse(multiply(X1,X2)),X3),X2)) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),X4),X3) = multiply(X1,multiply(X4,X2)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X3,X2))),X3) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,X3)),X3)),X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
inverse(multiply(inverse(multiply(X1,X2)),X2)) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
c_0_15 ).
cnf(c_0_19,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_21,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14])]),c_0_17])]),c_0_19]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP087-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.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 : Fri May 3 15:54:08 EDT 2024
% 0.14/0.35 % 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/tmp/tmp.lmWfwneyK9/E---3.1_3700.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y 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 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 3818 completed with status 0
% 0.20/0.51 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.20/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 3824 completed with status 0
% 0.20/0.51 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.20/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 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 : 2
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 2
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 2
% 0.20/0.51 # Processed clauses : 141
% 0.20/0.51 # ...of these trivial : 46
% 0.20/0.51 # ...subsumed : 62
% 0.20/0.51 # ...remaining for further processing : 33
% 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 : 0
% 0.20/0.51 # Backward-rewritten : 19
% 0.20/0.51 # Generated clauses : 699
% 0.20/0.51 # ...of the previous two non-redundant : 424
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 699
% 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 : 575
% 0.20/0.51 # ...of those cached : 427
% 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 : 14
% 0.20/0.51 # Positive orientable unit clauses : 11
% 0.20/0.51 # Positive unorientable unit clauses: 3
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 212
% 0.20/0.51 # ...number of literals in the above : 212
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 19
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 9
% 0.20/0.51 # Rewrite failures with RHS unbound : 42
% 0.20/0.51 # BW rewrite match attempts : 133
% 0.20/0.51 # BW rewrite match successes : 92
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4686
% 0.20/0.51 # Search garbage collected termcells : 11
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.010 s
% 0.20/0.51 # Maximum resident set size: 1564 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.031 s
% 0.20/0.51 # System time : 0.009 s
% 0.20/0.51 # Total time : 0.040 s
% 0.20/0.51 # Maximum resident set size: 1692 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------