TSTP Solution File: GRP580-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP580-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:50:02 EDT 2024
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 8 RR)
% Number of literals : 40 ( 39 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(X2,identity))),double_divide(identity,identity)) = double_divide(double_divide(X2,X1),identity),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(double_divide(identity,identity),double_divide(double_divide(X1,X2),double_divide(double_divide(X3,double_divide(double_divide(double_divide(X4,X3),X1),double_divide(X4,identity))),identity))),double_divide(identity,identity)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,plain,
double_divide(double_divide(X1,identity),double_divide(identity,identity)) = double_divide(double_divide(identity,X1),identity),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
double_divide(double_divide(double_divide(X1,X2),X2),double_divide(X1,identity)) = double_divide(identity,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_11]),c_0_8]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_8]),c_0_11]) ).
cnf(c_0_14,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_11]),c_0_13]) ).
cnf(c_0_15,plain,
double_divide(double_divide(double_divide(X1,X2),X2),double_divide(X1,identity)) = identity,
inference(rw,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(double_divide(identity,X1),identity),
inference(rw,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_17,plain,
double_divide(double_divide(double_divide(identity,X1),X1),identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
double_divide(double_divide(identity,double_divide(double_divide(X1,X2),double_divide(double_divide(X3,double_divide(double_divide(double_divide(X4,X3),X1),double_divide(X4,identity))),identity))),identity) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_14]),c_0_14]) ).
cnf(c_0_19,plain,
double_divide(double_divide(identity,double_divide(double_divide(identity,X1),X1)),identity) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]) ).
cnf(c_0_20,plain,
double_divide(double_divide(identity,double_divide(X1,identity)),identity) = double_divide(double_divide(identity,double_divide(identity,X1)),identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_16]),c_0_16]) ).
cnf(c_0_21,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(identity,X1))),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8]),c_0_17]),c_0_14]),c_0_20]) ).
cnf(c_0_22,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(identity,double_divide(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_23,plain,
double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,X1)))) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
double_divide(X1,identity) = double_divide(identity,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
double_divide(double_divide(identity,double_divide(X1,identity)),double_divide(X1,identity)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_26,plain,
double_divide(identity,double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),double_divide(X2,identity)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_14]),c_0_24]) ).
cnf(c_0_27,plain,
double_divide(double_divide(identity,X1),X1) = identity,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_8]) ).
cnf(c_0_29,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_31,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_22]),c_0_24]),c_0_26]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_30 ).
cnf(c_0_33,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_34,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
double_divide(double_divide(b,a),identity) != double_divide(double_divide(a,b),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]) ).
cnf(c_0_36,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_15]),c_0_24]),c_0_34]) ).
cnf(c_0_37,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_35,c_0_24]),c_0_24]) ).
cnf(c_0_38,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP580-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 05:04:38 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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/benchmark/theBenchmark.p
% 0.17/0.48 # Version: 3.1.0
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2765 completed with status 0
% 0.17/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.48 # Starting sh5l with 136s (1) cores
% 0.17/0.48 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 2770 completed with status 0
% 0.17/0.48 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.17/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.17/0.48 # Preprocessing time : 0.001 s
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Unsatisfiable
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 5
% 0.17/0.48 # Removed by relevancy pruning/SinE : 0
% 0.17/0.48 # Initial clauses : 5
% 0.17/0.48 # Removed in clause preprocessing : 2
% 0.17/0.48 # Initial clauses in saturation : 3
% 0.17/0.48 # Processed clauses : 60
% 0.17/0.48 # ...of these trivial : 14
% 0.17/0.48 # ...subsumed : 6
% 0.17/0.48 # ...remaining for further processing : 40
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 1
% 0.17/0.48 # Backward-rewritten : 34
% 0.17/0.48 # Generated clauses : 633
% 0.17/0.48 # ...of the previous two non-redundant : 378
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 633
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 780
% 0.17/0.48 # ...of those cached : 650
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 5
% 0.17/0.48 # Positive orientable unit clauses : 4
% 0.17/0.48 # Positive unorientable unit clauses: 1
% 0.17/0.48 # Negative unit clauses : 0
% 0.17/0.48 # Non-unit-clauses : 0
% 0.17/0.48 # Current number of unprocessed clauses: 214
% 0.17/0.48 # ...number of literals in the above : 214
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 37
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.48 # Non-unit clause-clause subsumptions : 0
% 0.17/0.48 # Unit Clause-clause subsumption calls : 11
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 122
% 0.17/0.48 # BW rewrite match successes : 64
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 8727
% 0.17/0.48 # Search garbage collected termcells : 2
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.009 s
% 0.17/0.48 # System time : 0.002 s
% 0.17/0.48 # Total time : 0.011 s
% 0.17/0.48 # Maximum resident set size: 1576 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.044 s
% 0.17/0.48 # System time : 0.007 s
% 0.17/0.48 # Total time : 0.051 s
% 0.17/0.48 # Maximum resident set size: 1688 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------