TSTP Solution File: GRP070-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP070-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:15 EDT 2024
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 27 ( 22 unt; 0 nHn; 8 RR)
% Number of literals : 36 ( 35 equ; 16 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
file('/export/starexec/sandbox2/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)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(X1,X1),divide(divide(divide(X2,divide(X3,X4)),inverse(X3)),divide(X2,inverse(X4)))) = divide(X5,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(X1,X1),divide(X2,divide(divide(X3,X3),inverse(X4)))) = divide(X4,X2),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
divide(divide(X1,X1),divide(divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4))),divide(divide(X5,X3),inverse(divide(X6,X6))))) = X5,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
divide(X1,divide(divide(X2,X2),inverse(X1))) = divide(X3,X3),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(X1,X1),inverse(X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]),c_0_3]) ).
cnf(c_0_10,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)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_11,plain,
divide(divide(X1,X1),divide(X2,X3)) = divide(X3,X2),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_12,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)) ),
c_0_10 ).
cnf(c_0_13,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_14,plain,
divide(divide(X1,X2),divide(X3,X3)) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_11]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
divide(divide(divide(X1,divide(X2,X3)),inverse(X2)),X3) = X1,
inference(rw,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_17,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(divide(a1,a1),inverse(a2)) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_5]),c_0_5]),c_0_5])]) ).
cnf(c_0_19,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_5]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_9])]) ).
cnf(c_0_21,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(X2,divide(X3,X4))),inverse(X2)) = divide(divide(X1,inverse(X3)),X4),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_23,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_24,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_21]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP070-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 05:02:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 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.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31677 completed with status 0
% 0.18/0.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.18/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.49 # Starting sh5l with 136s (1) cores
% 0.18/0.49 # SAT001_MinMin_p005000_rr_RG with pid 31681 completed with status 0
% 0.18/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FUHPF-FFSF21-MFFFFFNN
% 0.18/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 3
% 0.18/0.49 # Removed by relevancy pruning/SinE : 0
% 0.18/0.49 # Initial clauses : 3
% 0.18/0.49 # Removed in clause preprocessing : 1
% 0.18/0.49 # Initial clauses in saturation : 2
% 0.18/0.49 # Processed clauses : 74
% 0.18/0.49 # ...of these trivial : 11
% 0.18/0.49 # ...subsumed : 34
% 0.18/0.49 # ...remaining for further processing : 29
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 16
% 0.18/0.49 # Generated clauses : 521
% 0.18/0.49 # ...of the previous two non-redundant : 393
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 521
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 440
% 0.18/0.49 # ...of those cached : 245
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 11
% 0.18/0.49 # Positive orientable unit clauses : 10
% 0.18/0.49 # Positive unorientable unit clauses: 1
% 0.18/0.49 # Negative unit clauses : 0
% 0.18/0.49 # Non-unit-clauses : 0
% 0.18/0.49 # Current number of unprocessed clauses: 193
% 0.18/0.49 # ...number of literals in the above : 193
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 19
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.49 # Non-unit clause-clause subsumptions : 0
% 0.18/0.49 # Unit Clause-clause subsumption calls : 7
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 113
% 0.18/0.49 # BW rewrite match successes : 35
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 5285
% 0.18/0.49 # Search garbage collected termcells : 8
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.011 s
% 0.18/0.49 # System time : 0.001 s
% 0.18/0.49 # Total time : 0.012 s
% 0.18/0.49 # Maximum resident set size: 1592 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.052 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.057 s
% 0.18/0.49 # Maximum resident set size: 1688 pages
% 0.18/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------