TSTP Solution File: GRP470-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP470-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:57:09 EDT 2024
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 5 RR)
% Number of literals : 40 ( 39 equ; 4 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
divide(inverse(X1),divide(divide(X2,X3),inverse(divide(divide(X3,X2),divide(X1,divide(X4,X5)))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
inverse(divide(divide(inverse(divide(divide(X1,X2),divide(X3,X4))),divide(X2,X1)),divide(X5,divide(X4,X3)))) = inverse(inverse(X5)),
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_9,plain,
divide(inverse(X1),divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),divide(X4,X5)))),inverse(inverse(X1)))) = divide(X4,X5),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,divide(X4,X5))))),inverse(X3)) = divide(X4,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_7]) ).
cnf(c_0_11,plain,
divide(inverse(X1),divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(inverse(X1)))) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_12,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X3)) = X4,
inference(spm,[status(thm)],[c_0_10,c_0_3]) ).
cnf(c_0_13,plain,
divide(X1,divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(X1))) = X4,
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_14,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_15,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),divide(divide(X4,X5),divide(X1,X2))),divide(X5,X4)) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_17,plain,
divide(divide(divide(divide(divide(X1,X2),X3),inverse(divide(X3,X4))),inverse(X4)),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_18,plain,
inverse(divide(inverse(divide(X1,X2)),divide(X3,divide(X1,divide(X4,X5))))) = divide(inverse(divide(divide(X5,X4),X3)),X2),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_19,plain,
divide(divide(X1,divide(inverse(X2),X3)),X4) = divide(divide(X1,inverse(X3)),inverse(inverse(divide(X4,X2)))),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
divide(divide(divide(divide(divide(X1,X2),inverse(divide(X3,X4))),inverse(X4)),inverse(inverse(X3))),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_3]) ).
cnf(c_0_21,plain,
divide(X1,inverse(inverse(divide(X2,divide(X3,inverse(X2)))))) = divide(X1,inverse(X3)),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_22,plain,
inverse(divide(inverse(X1),divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_13]),c_0_4]) ).
cnf(c_0_23,plain,
inverse(inverse(divide(X1,divide(X2,inverse(X1))))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_13]) ).
cnf(c_0_24,plain,
inverse(divide(X1,divide(X2,inverse(X1)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]) ).
cnf(c_0_25,plain,
divide(divide(X1,X2),inverse(divide(divide(X2,X1),X3))) = inverse(X3),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_26,plain,
divide(divide(divide(X1,X2),X3),inverse(X3)) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_27,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_26]),c_0_25]) ).
cnf(c_0_28,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_29,plain,
divide(divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X5)),X5) = divide(X4,X3),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_31,plain,
inverse(divide(inverse(divide(X1,X2)),X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_27]) ).
cnf(c_0_32,plain,
inverse(divide(X1,inverse(divide(X2,X3)))) = divide(divide(X3,X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_30 ).
cnf(c_0_34,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_35,plain,
inverse(divide(X1,divide(X2,X3))) = divide(inverse(divide(X3,X2)),X1),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_36,plain,
inverse(divide(divide(X1,X2),X3)) = divide(X3,inverse(divide(X2,X1))),
inference(spm,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_38,plain,
divide(divide(X1,X1),inverse(X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_35]),c_0_36]),c_0_36]),c_0_28]),c_0_27]) ).
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.00/0.09 % Problem : GRP470-1 : TPTP v8.2.0. Released v2.6.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.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:09:37 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.45 # Version: 3.1.0
% 0.14/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 # Starting sh5l with 300s (1) cores
% 0.14/0.45 # new_bool_3 with pid 24290 completed with status 0
% 0.14/0.45 # Result found by new_bool_3
% 0.14/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.14/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.45 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 24294 completed with status 0
% 0.14/0.45 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.14/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.45 # Preprocessing time : 0.001 s
% 0.14/0.45 # Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 # Proof found!
% 0.14/0.45 # SZS status Unsatisfiable
% 0.14/0.45 # SZS output start CNFRefutation
% See solution above
% 0.14/0.45 # Parsed axioms : 3
% 0.14/0.45 # Removed by relevancy pruning/SinE : 0
% 0.14/0.45 # Initial clauses : 3
% 0.14/0.45 # Removed in clause preprocessing : 0
% 0.14/0.45 # Initial clauses in saturation : 3
% 0.14/0.45 # Processed clauses : 80
% 0.14/0.45 # ...of these trivial : 9
% 0.14/0.45 # ...subsumed : 19
% 0.14/0.45 # ...remaining for further processing : 52
% 0.14/0.45 # Other redundant clauses eliminated : 0
% 0.14/0.45 # Clauses deleted for lack of memory : 0
% 0.14/0.45 # Backward-subsumed : 0
% 0.14/0.45 # Backward-rewritten : 31
% 0.14/0.45 # Generated clauses : 3400
% 0.14/0.45 # ...of the previous two non-redundant : 3070
% 0.14/0.45 # ...aggressively subsumed : 0
% 0.14/0.45 # Contextual simplify-reflections : 0
% 0.14/0.45 # Paramodulations : 3400
% 0.14/0.45 # Factorizations : 0
% 0.14/0.45 # NegExts : 0
% 0.14/0.45 # Equation resolutions : 0
% 0.14/0.45 # Disequality decompositions : 0
% 0.14/0.45 # Total rewrite steps : 1287
% 0.14/0.45 # ...of those cached : 550
% 0.14/0.45 # Propositional unsat checks : 0
% 0.14/0.45 # Propositional check models : 0
% 0.14/0.45 # Propositional check unsatisfiable : 0
% 0.14/0.45 # Propositional clauses : 0
% 0.14/0.45 # Propositional clauses after purity: 0
% 0.14/0.45 # Propositional unsat core size : 0
% 0.14/0.45 # Propositional preprocessing time : 0.000
% 0.14/0.45 # Propositional encoding time : 0.000
% 0.14/0.45 # Propositional solver time : 0.000
% 0.14/0.45 # Success case prop preproc time : 0.000
% 0.14/0.45 # Success case prop encoding time : 0.000
% 0.14/0.45 # Success case prop solver time : 0.000
% 0.14/0.45 # Current number of processed clauses : 18
% 0.14/0.45 # Positive orientable unit clauses : 16
% 0.14/0.45 # Positive unorientable unit clauses: 2
% 0.14/0.45 # Negative unit clauses : 0
% 0.14/0.45 # Non-unit-clauses : 0
% 0.14/0.45 # Current number of unprocessed clauses: 2966
% 0.14/0.45 # ...number of literals in the above : 2966
% 0.14/0.45 # Current number of archived formulas : 0
% 0.14/0.45 # Current number of archived clauses : 34
% 0.14/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.45 # Non-unit clause-clause subsumptions : 0
% 0.14/0.45 # Unit Clause-clause subsumption calls : 29
% 0.14/0.45 # Rewrite failures with RHS unbound : 0
% 0.14/0.45 # BW rewrite match attempts : 143
% 0.14/0.45 # BW rewrite match successes : 40
% 0.14/0.45 # Condensation attempts : 0
% 0.14/0.45 # Condensation successes : 0
% 0.14/0.45 # Termbank termtop insertions : 53056
% 0.14/0.45 # Search garbage collected termcells : 2
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.042 s
% 0.14/0.45 # System time : 0.005 s
% 0.14/0.45 # Total time : 0.047 s
% 0.14/0.45 # Maximum resident set size: 1616 pages
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.043 s
% 0.14/0.45 # System time : 0.007 s
% 0.14/0.45 # Total time : 0.050 s
% 0.14/0.45 # Maximum resident set size: 1684 pages
% 0.14/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------