TSTP Solution File: GRP479-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP479-1 : TPTP v8.2.0. Released v2.6.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:49:09 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 6 RR)
% Number of literals : 34 ( 33 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
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(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4) = inverse(divide(divide(divide(X5,X5),X6),divide(X3,divide(X6,divide(X2,X4))))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4),divide(X2,X4)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(divide(X1,X1),inverse(divide(divide(divide(X2,X2),X3),divide(X4,divide(X3,X5))))),divide(X6,X4))),X5) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
inverse(divide(divide(divide(X1,X1),X2),X3)) = inverse(divide(divide(divide(X4,X4),X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_3]) ).
cnf(c_0_8,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4) = inverse(divide(divide(divide(X5,X5),divide(inverse(divide(divide(divide(b2,b2),X2),X6)),X4)),divide(X3,X6))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_4]) ).
cnf(c_0_9,plain,
inverse(divide(divide(divide(X1,X1),divide(X2,inverse(divide(divide(divide(X3,X3),X2),X4)))),X5)) = inverse(divide(X4,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
inverse(divide(divide(divide(X1,X1),divide(inverse(divide(X2,X3)),X4)),divide(X5,X3))) = divide(inverse(divide(X2,X5)),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X4),divide(X2,X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_3]) ).
cnf(c_0_12,plain,
divide(inverse(divide(X1,X2)),inverse(divide(divide(divide(X3,X3),inverse(divide(X1,X4))),X5))) = inverse(divide(X5,divide(X2,X4))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X4),divide(X3,X4)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
inverse(divide(divide(divide(X1,X1),inverse(divide(X2,divide(X3,X3)))),X4)) = inverse(divide(X2,X4)),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,X2))),X4),divide(X5,X4)) = divide(X3,X5),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_16,plain,
divide(divide(inverse(divide(X1,X2)),X3),divide(inverse(divide(X1,divide(X4,X4))),X3)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_17,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),divide(X3,X2)),X4)),X5),divide(divide(X3,X1),X5)) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_18,plain,
divide(X1,inverse(divide(divide(divide(X2,X2),X3),divide(X4,X4)))) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(X3,X3))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_20,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_22,plain,
inverse(divide(divide(divide(X1,X2),divide(inverse(divide(X3,X4)),X2)),divide(X5,X4))) = divide(inverse(divide(X3,X5)),X1),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_23,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
inverse(divide(X1,divide(divide(X2,X3),divide(inverse(divide(X1,divide(X4,X4))),X3)))) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_21 ).
cnf(c_0_26,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_27,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_20]),c_0_23]) ).
cnf(c_0_28,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_20]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_30,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP479-1 : TPTP v8.2.0. Released v2.6.0.
% 0.12/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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:56:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10355 completed with status 0
% 0.20/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 10359 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 3
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 3
% 0.20/0.52 # Removed in clause preprocessing : 1
% 0.20/0.52 # Initial clauses in saturation : 2
% 0.20/0.52 # Processed clauses : 49
% 0.20/0.52 # ...of these trivial : 3
% 0.20/0.52 # ...subsumed : 12
% 0.20/0.52 # ...remaining for further processing : 34
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 27
% 0.20/0.52 # Generated clauses : 1791
% 0.20/0.52 # ...of the previous two non-redundant : 1404
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 1791
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 812
% 0.20/0.52 # ...of those cached : 331
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 5
% 0.20/0.52 # Positive orientable unit clauses : 5
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 0
% 0.20/0.52 # Non-unit-clauses : 0
% 0.20/0.52 # Current number of unprocessed clauses: 1353
% 0.20/0.52 # ...number of literals in the above : 1353
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 30
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 8
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 191
% 0.20/0.52 # BW rewrite match successes : 52
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 28309
% 0.20/0.52 # Search garbage collected termcells : 2
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.030 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.032 s
% 0.20/0.52 # Maximum resident set size: 1568 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.149 s
% 0.20/0.52 # System time : 0.008 s
% 0.20/0.52 # Total time : 0.158 s
% 0.20/0.52 # Maximum resident set size: 1680 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------