TSTP Solution File: GRP086-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP086-1 : TPTP v8.1.2. Bugfixed v2.7.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:37:55 EDT 2023
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 25 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 32 ( 31 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 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 : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.GQK014gT7l/E---3.1_30527.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.GQK014gT7l/E---3.1_30527.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(multiply(X3,X2)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(X2,inverse(X3)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(X1))) = multiply(X3,X2),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(multiply(X2,X3),inverse(X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X1,X3),X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(X2,inverse(X1)),X3)) = multiply(X2,X3),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(multiply(X1,inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_10]) ).
cnf(c_0_14,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) ),
prove_these_axioms ).
cnf(c_0_15,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3))
| multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
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)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_4]),c_0_15])]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_19]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP086-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:41:10 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.GQK014gT7l/E---3.1_30527.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 30670 completed with status 0
% 0.22/0.53 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.22/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53 # Starting sh5l with 136s (1) cores
% 0.22/0.53 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 30675 completed with status 0
% 0.22/0.53 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.22/0.53 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 2
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 2
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 2
% 0.22/0.53 # Processed clauses : 182
% 0.22/0.53 # ...of these trivial : 59
% 0.22/0.53 # ...subsumed : 87
% 0.22/0.53 # ...remaining for further processing : 36
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 19
% 0.22/0.53 # Generated clauses : 1081
% 0.22/0.53 # ...of the previous two non-redundant : 685
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 1080
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Total rewrite steps : 846
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 16
% 0.22/0.53 # Positive orientable unit clauses : 12
% 0.22/0.53 # Positive unorientable unit clauses: 4
% 0.22/0.53 # Negative unit clauses : 0
% 0.22/0.53 # Non-unit-clauses : 0
% 0.22/0.53 # Current number of unprocessed clauses: 451
% 0.22/0.53 # ...number of literals in the above : 451
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 20
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 30
% 0.22/0.53 # Rewrite failures with RHS unbound : 40
% 0.22/0.53 # BW rewrite match attempts : 232
% 0.22/0.53 # BW rewrite match successes : 152
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 7667
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.013 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.019 s
% 0.22/0.53 # Maximum resident set size: 1544 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.082 s
% 0.22/0.53 # System time : 0.013 s
% 0.22/0.53 # Total time : 0.095 s
% 0.22/0.53 # Maximum resident set size: 1668 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------