TSTP Solution File: GRP587-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP587-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:42:12 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 24 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X3))),X2))) = X3,
file('/export/starexec/sandbox/tmp/tmp.Ua0lgcsenx/E---3.1_18559.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.Ua0lgcsenx/E---3.1_18559.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.Ua0lgcsenx/E---3.1_18559.p',prove_these_axioms_3) ).
cnf(c_0_3,axiom,
double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X3))),X2))) = X3,
single_axiom ).
cnf(c_0_4,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_5,plain,
double_divide(X1,multiply(X2,multiply(inverse(X3),double_divide(X1,X2)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
double_divide(X1,multiply(multiply(X2,multiply(inverse(X3),double_divide(X1,X2))),multiply(inverse(X4),X3))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,multiply(inverse(X2),double_divide(X3,X1))),X3) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
double_divide(multiply(inverse(X1),X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
multiply(inverse(X1),multiply(inverse(X2),X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(X1),inverse(multiply(inverse(X1),X2))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(inverse(X1),inverse(inverse(X2))) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
double_divide(inverse(X1),inverse(multiply(X2,X3))) = multiply(multiply(X2,X3),X1),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,multiply(multiply(X2,X3),double_divide(X4,X1))),X4) = multiply(X2,X3),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_14,plain,
multiply(multiply(inverse(X1),X2),X1) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_4]) ).
cnf(c_0_16,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_19,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
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_15,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_17]),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.07/0.14 % Problem : GRP587-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Oct 3 02:56:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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/tmp/tmp.Ua0lgcsenx/E---3.1_18559.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_3 with pid 18638 completed with status 0
% 0.23/0.54 # Result found by new_bool_3
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54 # SAT001_MinMin_p005000_rr_RG with pid 18642 completed with status 0
% 0.23/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 3
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 3
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 3
% 0.23/0.54 # Processed clauses : 148
% 0.23/0.54 # ...of these trivial : 46
% 0.23/0.54 # ...subsumed : 35
% 0.23/0.54 # ...remaining for further processing : 67
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 44
% 0.23/0.54 # Generated clauses : 1533
% 0.23/0.54 # ...of the previous two non-redundant : 1227
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 1533
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 848
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 20
% 0.23/0.54 # Positive orientable unit clauses : 16
% 0.23/0.54 # Positive unorientable unit clauses: 4
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 0
% 0.23/0.54 # Current number of unprocessed clauses: 1032
% 0.23/0.54 # ...number of literals in the above : 1032
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 47
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.54 # Non-unit clause-clause subsumptions : 0
% 0.23/0.54 # Unit Clause-clause subsumption calls : 26
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 210
% 0.23/0.54 # BW rewrite match successes : 180
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 12501
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.020 s
% 0.23/0.54 # System time : 0.002 s
% 0.23/0.54 # Total time : 0.022 s
% 0.23/0.54 # Maximum resident set size: 1612 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.020 s
% 0.23/0.54 # System time : 0.005 s
% 0.23/0.54 # Total time : 0.025 s
% 0.23/0.54 # Maximum resident set size: 1672 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------