TSTP Solution File: GRP080-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP080-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:53:17 EDT 2024
% Result : Unsatisfiable 1.50s 0.68s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 44 ( 37 unt; 0 nHn; 12 RR)
% Number of literals : 56 ( 55 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/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,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
single_axiom ).
cnf(c_0_9,plain,
double_divide(identity,identity) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),X1) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X1))),identity) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,double_divide(double_divide(X1,X2),identity)),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_15,plain,
double_divide(double_divide(identity,double_divide(double_divide(double_divide(X1,double_divide(X2,X3)),identity),double_divide(X4,identity))),double_divide(double_divide(X4,X2),identity)) = double_divide(identity,double_divide(X3,double_divide(X1,identity))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_16,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_7]),c_0_9]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
c_0_14 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_19,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X1))),X2) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_20,plain,
double_divide(double_divide(identity,double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X3))),double_divide(X4,identity))),double_divide(identity,double_divide(X4,X2))) = double_divide(identity,double_divide(X3,double_divide(X1,identity))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( double_divide(double_divide(a2,identity),identity) != a2
| double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity
| double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity) != double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) ),
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_17,c_0_6]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
double_divide(identity,double_divide(identity,double_divide(X1,double_divide(X2,X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_9]),c_0_9]) ).
cnf(c_0_23,plain,
double_divide(identity,double_divide(X1,double_divide(X2,identity))) = double_divide(X2,double_divide(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_9]),c_0_9]),c_0_9]),c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)
| double_divide(double_divide(a2,identity),identity) != a2
| double_divide(identity,identity) != identity ),
inference(rw,[status(thm)],[c_0_21,c_0_7]) ).
cnf(c_0_25,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)
| double_divide(double_divide(a2,identity),identity) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_9])]) ).
cnf(c_0_27,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_28,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(identity,double_divide(X2,double_divide(X3,X1)))) = X3,
inference(rw,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3))))
| double_divide(identity,double_divide(identity,a2)) != a2 ),
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_26,c_0_16]),c_0_16]),c_0_16]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_30,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_31,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,plain,
double_divide(double_divide(X1,double_divide(identity,X2)),double_divide(identity,double_divide(X1,double_divide(X3,X2)))) = X3,
inference(rw,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_27])]) ).
cnf(c_0_34,plain,
double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(identity,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_35,plain,
double_divide(double_divide(identity,X1),double_divide(identity,X2)) = double_divide(identity,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_36,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X3))),X2) = double_divide(X1,double_divide(identity,X3)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(double_divide(b3,a3),double_divide(identity,c3)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
double_divide(identity,double_divide(double_divide(identity,X1),X2)) = double_divide(double_divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_39,plain,
double_divide(double_divide(identity,X1),double_divide(X2,identity)) = double_divide(identity,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_40,plain,
double_divide(double_divide(identity,double_divide(X1,X2)),X3) = double_divide(X1,double_divide(identity,double_divide(X2,X3))),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
double_divide(double_divide(b3,a3),double_divide(identity,c3)) != double_divide(double_divide(identity,a3),double_divide(c3,b3)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
double_divide(double_divide(identity,X1),double_divide(X2,X3)) = double_divide(double_divide(X3,X1),double_divide(identity,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31]),c_0_40]),c_0_34]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP080-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 04:35:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.50/0.68 # Version: 3.1.0
% 1.50/0.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.50/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.50/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.50/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.50/0.68 # Starting sh5l with 300s (1) cores
% 1.50/0.68 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1515 completed with status 0
% 1.50/0.68 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.50/0.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.50/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.50/0.68 # No SInE strategy applied
% 1.50/0.68 # Search class: FUHPS-FFSF22-MFFFFFNN
% 1.50/0.68 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 1.50/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.50/0.68 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 1.50/0.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.50/0.68 # Starting new_bool_3 with 136s (1) cores
% 1.50/0.68 # Starting new_bool_1 with 136s (1) cores
% 1.50/0.68 # Starting sh5l with 136s (1) cores
% 1.50/0.68 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 1519 completed with status 0
% 1.50/0.68 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 1.50/0.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.50/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.50/0.68 # No SInE strategy applied
% 1.50/0.68 # Search class: FUHPS-FFSF22-MFFFFFNN
% 1.50/0.68 # partial match(1): FUUPS-FFSF22-MFFFFFNN
% 1.50/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.50/0.68 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 1.50/0.68 # Preprocessing time : 0.001 s
% 1.50/0.68
% 1.50/0.68 # Proof found!
% 1.50/0.68 # SZS status Unsatisfiable
% 1.50/0.68 # SZS output start CNFRefutation
% See solution above
% 1.50/0.68 # Parsed axioms : 5
% 1.50/0.68 # Removed by relevancy pruning/SinE : 0
% 1.50/0.68 # Initial clauses : 5
% 1.50/0.68 # Removed in clause preprocessing : 2
% 1.50/0.68 # Initial clauses in saturation : 3
% 1.50/0.68 # Processed clauses : 818
% 1.50/0.68 # ...of these trivial : 312
% 1.50/0.68 # ...subsumed : 399
% 1.50/0.68 # ...remaining for further processing : 107
% 1.50/0.68 # Other redundant clauses eliminated : 0
% 1.50/0.68 # Clauses deleted for lack of memory : 0
% 1.50/0.68 # Backward-subsumed : 0
% 1.50/0.68 # Backward-rewritten : 61
% 1.50/0.68 # Generated clauses : 11038
% 1.50/0.68 # ...of the previous two non-redundant : 5836
% 1.50/0.68 # ...aggressively subsumed : 0
% 1.50/0.68 # Contextual simplify-reflections : 0
% 1.50/0.68 # Paramodulations : 11038
% 1.50/0.68 # Factorizations : 0
% 1.50/0.68 # NegExts : 0
% 1.50/0.68 # Equation resolutions : 0
% 1.50/0.68 # Disequality decompositions : 0
% 1.50/0.68 # Total rewrite steps : 29656
% 1.50/0.68 # ...of those cached : 22814
% 1.50/0.68 # Propositional unsat checks : 0
% 1.50/0.68 # Propositional check models : 0
% 1.50/0.68 # Propositional check unsatisfiable : 0
% 1.50/0.68 # Propositional clauses : 0
% 1.50/0.68 # Propositional clauses after purity: 0
% 1.50/0.68 # Propositional unsat core size : 0
% 1.50/0.68 # Propositional preprocessing time : 0.000
% 1.50/0.68 # Propositional encoding time : 0.000
% 1.50/0.68 # Propositional solver time : 0.000
% 1.50/0.68 # Success case prop preproc time : 0.000
% 1.50/0.68 # Success case prop encoding time : 0.000
% 1.50/0.68 # Success case prop solver time : 0.000
% 1.50/0.68 # Current number of processed clauses : 46
% 1.50/0.68 # Positive orientable unit clauses : 42
% 1.50/0.68 # Positive unorientable unit clauses: 4
% 1.50/0.68 # Negative unit clauses : 0
% 1.50/0.68 # Non-unit-clauses : 0
% 1.50/0.68 # Current number of unprocessed clauses: 4178
% 1.50/0.68 # ...number of literals in the above : 4178
% 1.50/0.68 # Current number of archived formulas : 0
% 1.50/0.68 # Current number of archived clauses : 63
% 1.50/0.68 # Clause-clause subsumption calls (NU) : 0
% 1.50/0.68 # Rec. Clause-clause subsumption calls : 0
% 1.50/0.68 # Non-unit clause-clause subsumptions : 0
% 1.50/0.68 # Unit Clause-clause subsumption calls : 56
% 1.50/0.68 # Rewrite failures with RHS unbound : 0
% 1.50/0.68 # BW rewrite match attempts : 434
% 1.50/0.68 # BW rewrite match successes : 96
% 1.50/0.68 # Condensation attempts : 0
% 1.50/0.68 # Condensation successes : 0
% 1.50/0.68 # Termbank termtop insertions : 196477
% 1.50/0.68 # Search garbage collected termcells : 8
% 1.50/0.68
% 1.50/0.68 # -------------------------------------------------
% 1.50/0.68 # User time : 0.151 s
% 1.50/0.68 # System time : 0.011 s
% 1.50/0.68 # Total time : 0.162 s
% 1.50/0.68 # Maximum resident set size: 1676 pages
% 1.50/0.68
% 1.50/0.68 # -------------------------------------------------
% 1.50/0.68 # User time : 0.765 s
% 1.50/0.68 # System time : 0.022 s
% 1.50/0.68 # Total time : 0.787 s
% 1.50/0.68 # Maximum resident set size: 1688 pages
% 1.50/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------