TSTP Solution File: GRP568-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP568-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:09 EDT 2023
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 25 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox/tmp/tmp.Jcj2bVMRmF/E---3.1_17616.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/tmp/tmp.Jcj2bVMRmF/E---3.1_17616.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/tmp/tmp.Jcj2bVMRmF/E---3.1_17616.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(identity,identity)) = X2,
single_axiom ).
cnf(c_0_4,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(X2,double_divide(double_divide(X1,double_divide(X2,X3)),double_divide(identity,X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(double_divide(identity,X1),double_divide(identity,identity)) = double_divide(identity,double_divide(X1,double_divide(identity,identity))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_3]) ).
cnf(c_0_6,plain,
double_divide(identity,double_divide(double_divide(double_divide(X1,double_divide(identity,X2)),double_divide(identity,X2)),double_divide(identity,identity))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(identity,double_divide(double_divide(double_divide(X1,X2),X2),double_divide(identity,identity))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_6]),c_0_5]) ).
cnf(c_0_8,plain,
double_divide(double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(double_divide(X4,X2),double_divide(identity,double_divide(identity,identity)))),double_divide(identity,identity)) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_9,plain,
double_divide(identity,double_divide(X1,double_divide(identity,identity))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(X1,double_divide(identity,identity)) = double_divide(identity,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(identity,identity) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))) = double_divide(identity,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_13]),c_0_13]),c_0_10]) ).
cnf(c_0_15,plain,
double_divide(X1,double_divide(identity,X1)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
double_divide(X1,identity) = double_divide(identity,X1),
inference(rw,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_19,plain,
double_divide(X1,double_divide(double_divide(X2,identity),X1)) = double_divide(identity,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]) ).
cnf(c_0_20,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
double_divide(double_divide(a,b),identity) != double_divide(double_divide(b,a),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
double_divide(identity,double_divide(a,b)) != double_divide(identity,double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_16]) ).
cnf(c_0_24,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : GRP568-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:53:07 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.Jcj2bVMRmF/E---3.1_17616.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_1 with pid 17696 completed with status 0
% 0.15/0.43 # Result found by new_bool_1
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 17701 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 5
% 0.15/0.43 # Removed by relevancy pruning/SinE : 2
% 0.15/0.43 # Initial clauses : 3
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 3
% 0.15/0.43 # Processed clauses : 41
% 0.15/0.43 # ...of these trivial : 9
% 0.15/0.43 # ...subsumed : 5
% 0.15/0.43 # ...remaining for further processing : 27
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 21
% 0.15/0.43 # Generated clauses : 229
% 0.15/0.43 # ...of the previous two non-redundant : 168
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 229
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 182
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 5
% 0.15/0.43 # Positive orientable unit clauses : 4
% 0.15/0.43 # Positive unorientable unit clauses: 1
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 0
% 0.15/0.43 # Current number of unprocessed clauses: 120
% 0.15/0.43 # ...number of literals in the above : 120
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 22
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 7
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 82
% 0.15/0.43 # BW rewrite match successes : 59
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 3331
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.002 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.005 s
% 0.15/0.43 # Maximum resident set size: 1424 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.004 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1672 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------