TSTP Solution File: GRP471-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP471-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 3
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 6 RR)
% Number of literals : 53 ( 52 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 : 180 ( 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/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/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,
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_8,plain,
divide(inverse(inverse(X1)),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),divide(X2,X3))),divide(X5,X4)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,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_10,plain,
divide(inverse(inverse(X1)),divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_11,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_9,c_0_9]),c_0_9]) ).
cnf(c_0_12,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_3,c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X3)) = X4,
inference(spm,[status(thm)],[c_0_11,c_0_3]) ).
cnf(c_0_14,plain,
divide(X1,divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(X1))) = X4,
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_15,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_13,c_0_5]) ).
cnf(c_0_16,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_14,c_0_15]) ).
cnf(c_0_17,plain,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_18,plain,
divide(divide(divide(divide(divide(X1,X2),X3),inverse(divide(X3,X4))),inverse(X4)),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
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_18,c_0_18]) ).
cnf(c_0_20,plain,
divide(inverse(inverse(divide(X1,X2))),divide(X3,inverse(X4))) = divide(X1,divide(X3,divide(inverse(X2),X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_9]) ).
cnf(c_0_21,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_14]),c_0_4]) ).
cnf(c_0_22,plain,
inverse(divide(inverse(inverse(divide(X1,X2))),divide(X3,divide(inverse(X4),X5)))) = inverse(divide(X1,divide(X3,divide(divide(inverse(X2),X4),X5)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_20]),c_0_4]) ).
cnf(c_0_23,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_15,c_0_21]) ).
cnf(c_0_24,plain,
divide(inverse(inverse(divide(X1,X2))),divide(X3,divide(inverse(X4),X5))) = divide(X1,divide(X3,divide(divide(inverse(X2),X4),X5))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_10]) ).
cnf(c_0_25,plain,
divide(divide(X1,divide(divide(inverse(X2),X3),X4)),X5) = divide(divide(X1,inverse(X4)),inverse(inverse(divide(inverse(inverse(divide(X5,X2))),X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_23]),c_0_19]) ).
cnf(c_0_26,plain,
divide(divide(X1,divide(X2,X3)),X4) = divide(divide(X1,inverse(X3)),inverse(inverse(divide(X4,inverse(X2))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_10]),c_0_10]) ).
cnf(c_0_27,plain,
divide(X1,divide(X2,divide(inverse(inverse(X3)),X4))) = divide(X1,divide(X2,divide(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_23]),c_0_20]) ).
cnf(c_0_28,plain,
divide(inverse(divide(inverse(X1),divide(X2,divide(inverse(divide(divide(X3,X4),divide(X1,X5))),divide(X4,X3))))),X5) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_29,plain,
divide(inverse(inverse(X1)),X2) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_27]),c_0_13]) ).
cnf(c_0_30,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]) ).
cnf(c_0_31,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(divide(divide(X4,X5),X6),inverse(divide(X6,divide(X3,divide(X5,X4))))),X1)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_32,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_17]) ).
cnf(c_0_33,plain,
divide(divide(X1,divide(X2,X3)),X4) = divide(divide(X1,inverse(X3)),divide(X4,inverse(X2))),
inference(rw,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_34,plain,
divide(divide(X1,X2),divide(X3,inverse(X4))) = divide(X1,divide(X3,divide(inverse(X2),X4))),
inference(rw,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_35,plain,
divide(inverse(divide(X1,X2)),divide(X3,X1)) = divide(inverse(divide(X4,X2)),divide(X3,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_31]),c_0_32]),c_0_3]) ).
cnf(c_0_36,plain,
divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_37,plain,
divide(divide(X1,divide(X2,X3)),X4) = divide(X1,divide(X4,divide(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_30]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_39,plain,
divide(inverse(X1),divide(X2,X1)) = divide(inverse(X3),divide(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_40,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]),c_0_3]) ).
cnf(c_0_41,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_38 ).
cnf(c_0_42,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_43,plain,
divide(inverse(X1),divide(X2,X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
divide(divide(X1,X2),inverse(divide(X2,X3))) = divide(divide(X1,X4),inverse(divide(X4,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_35]),c_0_9]) ).
cnf(c_0_45,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_15]) ).
cnf(c_0_46,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_40]),c_0_37]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42]),c_0_42]),c_0_42]) ).
cnf(c_0_48,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30]),c_0_34]),c_0_43]),c_0_45]) ).
cnf(c_0_49,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_30,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
divide(divide(X1,X2),X3) = divide(X1,divide(X3,inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_49]),c_0_30]),c_0_49]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP471-1 : TPTP v8.2.0. Released v2.6.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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:21:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 0.20/0.57 # Version: 3.1.0
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # new_bool_1 with pid 26481 completed with status 0
% 0.20/0.57 # Result found by new_bool_1
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.57 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.57 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 26485 completed with status 0
% 0.20/0.57 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.57 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.57 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.57 # Preprocessing time : 0.001 s
% 0.20/0.57 # Presaturation interreduction done
% 0.20/0.57
% 0.20/0.57 # Proof found!
% 0.20/0.57 # SZS status Unsatisfiable
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57 # Parsed axioms : 3
% 0.20/0.57 # Removed by relevancy pruning/SinE : 0
% 0.20/0.57 # Initial clauses : 3
% 0.20/0.57 # Removed in clause preprocessing : 0
% 0.20/0.57 # Initial clauses in saturation : 3
% 0.20/0.57 # Processed clauses : 138
% 0.20/0.57 # ...of these trivial : 28
% 0.20/0.57 # ...subsumed : 51
% 0.20/0.57 # ...remaining for further processing : 59
% 0.20/0.57 # Other redundant clauses eliminated : 0
% 0.20/0.57 # Clauses deleted for lack of memory : 0
% 0.20/0.57 # Backward-subsumed : 0
% 0.20/0.57 # Backward-rewritten : 46
% 0.20/0.57 # Generated clauses : 4662
% 0.20/0.57 # ...of the previous two non-redundant : 4184
% 0.20/0.57 # ...aggressively subsumed : 0
% 0.20/0.57 # Contextual simplify-reflections : 0
% 0.20/0.57 # Paramodulations : 4662
% 0.20/0.57 # Factorizations : 0
% 0.20/0.57 # NegExts : 0
% 0.20/0.57 # Equation resolutions : 0
% 0.20/0.57 # Disequality decompositions : 0
% 0.20/0.57 # Total rewrite steps : 3597
% 0.20/0.57 # ...of those cached : 1869
% 0.20/0.57 # Propositional unsat checks : 0
% 0.20/0.57 # Propositional check models : 0
% 0.20/0.57 # Propositional check unsatisfiable : 0
% 0.20/0.57 # Propositional clauses : 0
% 0.20/0.57 # Propositional clauses after purity: 0
% 0.20/0.57 # Propositional unsat core size : 0
% 0.20/0.57 # Propositional preprocessing time : 0.000
% 0.20/0.57 # Propositional encoding time : 0.000
% 0.20/0.57 # Propositional solver time : 0.000
% 0.20/0.57 # Success case prop preproc time : 0.000
% 0.20/0.57 # Success case prop encoding time : 0.000
% 0.20/0.57 # Success case prop solver time : 0.000
% 0.20/0.57 # Current number of processed clauses : 10
% 0.20/0.57 # Positive orientable unit clauses : 9
% 0.20/0.57 # Positive unorientable unit clauses: 1
% 0.20/0.57 # Negative unit clauses : 0
% 0.20/0.57 # Non-unit-clauses : 0
% 0.20/0.57 # Current number of unprocessed clauses: 3970
% 0.20/0.57 # ...number of literals in the above : 3970
% 0.20/0.57 # Current number of archived formulas : 0
% 0.20/0.57 # Current number of archived clauses : 49
% 0.20/0.57 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.57 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.57 # Non-unit clause-clause subsumptions : 0
% 0.20/0.57 # Unit Clause-clause subsumption calls : 102
% 0.20/0.57 # Rewrite failures with RHS unbound : 0
% 0.20/0.57 # BW rewrite match attempts : 428
% 0.20/0.57 # BW rewrite match successes : 69
% 0.20/0.57 # Condensation attempts : 0
% 0.20/0.57 # Condensation successes : 0
% 0.20/0.57 # Termbank termtop insertions : 74932
% 0.20/0.57 # Search garbage collected termcells : 2
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.081 s
% 0.20/0.57 # System time : 0.004 s
% 0.20/0.57 # Total time : 0.085 s
% 0.20/0.57 # Maximum resident set size: 1616 pages
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.081 s
% 0.20/0.57 # System time : 0.007 s
% 0.20/0.57 # Total time : 0.088 s
% 0.20/0.57 # Maximum resident set size: 1680 pages
% 0.20/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------