TSTP Solution File: GRP451-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP451-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:05 EDT 2024
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 24 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_7,plain,
divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_9,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,plain,
divide(inverse(inverse(multiply(X1,X2))),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_5]) ).
cnf(c_0_11,plain,
multiply(inverse(inverse(multiply(X1,inverse(X2)))),X2) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,plain,
inverse(inverse(multiply(X1,inverse(inverse(X2))))) = multiply(inverse(inverse(X1)),X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
multiply(multiply(inverse(inverse(X1)),X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_9]) ).
cnf(c_0_16,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,X2),inverse(X2)) = inverse(inverse(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(inverse(inverse(X2)))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_20,plain,
multiply(divide(X1,X2),X2) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_21,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_22,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_19 ).
cnf(c_0_23,plain,
multiply(inverse(X1),X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP451-1 : TPTP v8.2.0. Released v2.6.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 05:14:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 15292 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 15296 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 4
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 4
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 4
% 0.21/0.49 # Processed clauses : 33
% 0.21/0.49 # ...of these trivial : 5
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 28
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 6
% 0.21/0.49 # Generated clauses : 231
% 0.21/0.49 # ...of the previous two non-redundant : 160
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 231
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 123
% 0.21/0.49 # ...of those cached : 54
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 18
% 0.21/0.49 # Positive orientable unit clauses : 17
% 0.21/0.49 # Positive unorientable unit clauses: 1
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 133
% 0.21/0.49 # ...number of literals in the above : 133
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 10
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 7
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 32
% 0.21/0.49 # BW rewrite match successes : 8
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 2448
% 0.21/0.49 # Search garbage collected termcells : 2
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.006 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1624 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.006 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.010 s
% 0.21/0.49 # Maximum resident set size: 1688 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------