TSTP Solution File: GRP105-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP105-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:45:34 EDT 2024
% Result : Unsatisfiable 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 32 unt; 0 nHn; 5 RR)
% Number of literals : 48 ( 47 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X3))))),X2) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X3))))),X2) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X1,inverse(X2)),inverse(double_divide(X1,inverse(X3))))),X4),inverse(X3))),X4) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(double_divide(X1,inverse(X1))),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(X1),inverse(inverse(double_divide(X2,inverse(X1))))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
inverse(double_divide(X1,inverse(double_divide(X2,inverse(X2))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(X1,inverse(inverse(double_divide(X2,X1)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(X1,inverse(inverse(double_divide(X1,X2)))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(X1,inverse(inverse(X2))) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_15,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(inverse(X1),inverse(double_divide(X1,inverse(X2)))) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
double_divide(double_divide(X1,inverse(X1)),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_19,plain,
double_divide(X1,inverse(double_divide(double_divide(X2,X1),double_divide(inverse(X2),X3)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_14]),c_0_17]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,plain,
inverse(double_divide(double_divide(X1,X2),double_divide(inverse(X1),X3))) = double_divide(X2,X3),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_22,plain,
double_divide(double_divide(X1,X2),double_divide(inverse(X1),X3)) = inverse(double_divide(X2,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_24,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,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) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_26,plain,
double_divide(double_divide(X1,X2),inverse(double_divide(X2,X3))) = double_divide(inverse(X1),X3),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_27,plain,
double_divide(inverse(double_divide(X1,X2)),double_divide(X1,X3)) = double_divide(X2,inverse(X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_24]) ).
cnf(c_0_28,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) ),
c_0_25 ).
cnf(c_0_29,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_30,plain,
double_divide(double_divide(X1,X2),inverse(X3)) = double_divide(inverse(X1),double_divide(X2,X3)),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_31,plain,
double_divide(inverse(double_divide(X1,X2)),X3) = double_divide(X2,inverse(double_divide(X1,X3))),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1)))
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)) ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_33,plain,
double_divide(X1,inverse(double_divide(X2,X3))) = double_divide(X2,inverse(double_divide(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_24]),c_0_31]) ).
cnf(c_0_34,plain,
double_divide(X1,inverse(X1)) = double_divide(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_8])]),c_0_31]),c_0_33]),c_0_17]),c_0_17]),c_0_17]),c_0_14]),c_0_17]),c_0_14]),c_0_14])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP105-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 04:35:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.39 Running first-order theorem proving
% 0.16/0.39 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/benchmark/theBenchmark.p
% 0.16/0.42 # Version: 3.1.0
% 0.16/0.42 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 367 completed with status 0
% 0.16/0.42 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.16/0.42 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: FUHPF-FFSF21-DFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 0.16/0.42 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.16/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.42 # Starting sh5l with 136s (1) cores
% 0.16/0.42 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 373 completed with status 0
% 0.16/0.42 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.16/0.42 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: FUHPF-FFSF21-DFFFFFNN
% 0.16/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 0.16/0.42 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Unsatisfiable
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 3
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 3
% 0.16/0.42 # Removed in clause preprocessing : 1
% 0.16/0.42 # Initial clauses in saturation : 2
% 0.16/0.42 # Processed clauses : 768
% 0.16/0.42 # ...of these trivial : 182
% 0.16/0.42 # ...subsumed : 519
% 0.16/0.42 # ...remaining for further processing : 66
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 35
% 0.16/0.42 # Generated clauses : 3071
% 0.16/0.42 # ...of the previous two non-redundant : 2421
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 3071
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 7353
% 0.16/0.42 # ...of those cached : 5593
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 31
% 0.16/0.42 # Positive orientable unit clauses : 22
% 0.16/0.42 # Positive unorientable unit clauses: 9
% 0.16/0.42 # Negative unit clauses : 0
% 0.16/0.42 # Non-unit-clauses : 0
% 0.16/0.42 # Current number of unprocessed clauses: 1327
% 0.16/0.42 # ...number of literals in the above : 1327
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 36
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 104
% 0.16/0.42 # Rewrite failures with RHS unbound : 37
% 0.16/0.42 # BW rewrite match attempts : 184
% 0.16/0.42 # BW rewrite match successes : 130
% 0.16/0.42 # Condensation attempts : 0
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 32756
% 0.16/0.42 # Search garbage collected termcells : 11
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.016 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.018 s
% 0.16/0.42 # Maximum resident set size: 1588 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.104 s
% 0.16/0.42 # System time : 0.006 s
% 0.16/0.42 # Total time : 0.109 s
% 0.16/0.43 # Maximum resident set size: 1692 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------