TSTP Solution File: HEN004-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HEN004-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 21:33:39 EDT 2024
% Result : Unsatisfiable 0.38s 0.55s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 22 unt; 0 nHn; 20 RR)
% Number of literals : 75 ( 6 equ; 40 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_property,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(x_divide_x_is_zero,axiom,
quotient(X1,X1,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(prove_x_divde_zero_is_x,negated_conjecture,
~ quotient(x,zero,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divde_zero_is_x) ).
cnf(c_0_9,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_10,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
c_0_9 ).
cnf(c_0_11,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_12,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X4,X5,X3)
| ~ quotient(X6,X5,X2)
| ~ quotient(X7,X5,X1)
| ~ quotient(X7,X6,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
quotient(X1,X1,zero),
x_divide_x_is_zero ).
cnf(c_0_14,plain,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_16,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,zero,X3)
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_18,plain,
( less_equal(divide(X1,zero),zero)
| ~ quotient(X2,divide(X2,zero),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_17 ).
cnf(c_0_20,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_21,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_22,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_23,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
c_0_22 ).
cnf(c_0_25,plain,
quotient(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_26,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_21])]) ).
cnf(c_0_28,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_29,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_30,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
c_0_28 ).
cnf(c_0_31,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_32,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_11]) ).
cnf(c_0_33,negated_conjecture,
~ quotient(x,zero,x),
inference(fof_simplification,[status(thm)],[prove_x_divde_zero_is_x]) ).
cnf(c_0_34,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
~ quotient(x,zero,x),
c_0_33 ).
cnf(c_0_36,plain,
quotient(X1,zero,X1),
inference(spm,[status(thm)],[c_0_11,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : HEN004-2 : TPTP v8.2.0. Released v1.0.0.
% 0.15/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n029.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun May 19 22:52:08 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.38/0.55 # Version: 3.1.0
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 412 completed with status 0
% 0.38/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # No SInE strategy applied
% 0.38/0.55 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.38/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.38/0.55 # Starting sh5l with 136s (1) cores
% 0.38/0.55 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 416 completed with status 0
% 0.38/0.55 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # No SInE strategy applied
% 0.38/0.55 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.38/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.38/0.55 # Preprocessing time : 0.001 s
% 0.38/0.55 # Presaturation interreduction done
% 0.38/0.55
% 0.38/0.55 # Proof found!
% 0.38/0.55 # SZS status Unsatisfiable
% 0.38/0.55 # SZS output start CNFRefutation
% See solution above
% 0.38/0.55 # Parsed axioms : 13
% 0.38/0.55 # Removed by relevancy pruning/SinE : 0
% 0.38/0.55 # Initial clauses : 13
% 0.38/0.55 # Removed in clause preprocessing : 0
% 0.38/0.55 # Initial clauses in saturation : 13
% 0.38/0.55 # Processed clauses : 73
% 0.38/0.55 # ...of these trivial : 0
% 0.38/0.55 # ...subsumed : 13
% 0.38/0.55 # ...remaining for further processing : 60
% 0.38/0.55 # Other redundant clauses eliminated : 0
% 0.38/0.55 # Clauses deleted for lack of memory : 0
% 0.38/0.55 # Backward-subsumed : 0
% 0.38/0.55 # Backward-rewritten : 15
% 0.38/0.55 # Generated clauses : 201
% 0.38/0.55 # ...of the previous two non-redundant : 89
% 0.38/0.55 # ...aggressively subsumed : 0
% 0.38/0.55 # Contextual simplify-reflections : 0
% 0.38/0.55 # Paramodulations : 201
% 0.38/0.55 # Factorizations : 0
% 0.38/0.55 # NegExts : 0
% 0.38/0.55 # Equation resolutions : 0
% 0.38/0.55 # Disequality decompositions : 0
% 0.38/0.55 # Total rewrite steps : 187
% 0.38/0.55 # ...of those cached : 147
% 0.38/0.55 # Propositional unsat checks : 0
% 0.38/0.55 # Propositional check models : 0
% 0.38/0.55 # Propositional check unsatisfiable : 0
% 0.38/0.55 # Propositional clauses : 0
% 0.38/0.55 # Propositional clauses after purity: 0
% 0.38/0.55 # Propositional unsat core size : 0
% 0.38/0.55 # Propositional preprocessing time : 0.000
% 0.38/0.55 # Propositional encoding time : 0.000
% 0.38/0.55 # Propositional solver time : 0.000
% 0.38/0.55 # Success case prop preproc time : 0.000
% 0.38/0.55 # Success case prop encoding time : 0.000
% 0.38/0.55 # Success case prop solver time : 0.000
% 0.38/0.55 # Current number of processed clauses : 32
% 0.38/0.55 # Positive orientable unit clauses : 15
% 0.38/0.55 # Positive unorientable unit clauses: 0
% 0.38/0.55 # Negative unit clauses : 0
% 0.38/0.55 # Non-unit-clauses : 17
% 0.38/0.55 # Current number of unprocessed clauses: 41
% 0.38/0.55 # ...number of literals in the above : 116
% 0.38/0.55 # Current number of archived formulas : 0
% 0.38/0.55 # Current number of archived clauses : 28
% 0.38/0.55 # Clause-clause subsumption calls (NU) : 220
% 0.38/0.55 # Rec. Clause-clause subsumption calls : 176
% 0.38/0.55 # Non-unit clause-clause subsumptions : 13
% 0.38/0.55 # Unit Clause-clause subsumption calls : 14
% 0.38/0.55 # Rewrite failures with RHS unbound : 0
% 0.38/0.55 # BW rewrite match attempts : 32
% 0.38/0.55 # BW rewrite match successes : 8
% 0.38/0.55 # Condensation attempts : 0
% 0.38/0.55 # Condensation successes : 0
% 0.38/0.55 # Termbank termtop insertions : 2337
% 0.38/0.55 # Search garbage collected termcells : 30
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.007 s
% 0.38/0.55 # System time : 0.001 s
% 0.38/0.55 # Total time : 0.008 s
% 0.38/0.55 # Maximum resident set size: 1636 pages
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.028 s
% 0.38/0.55 # System time : 0.006 s
% 0.38/0.55 # Total time : 0.035 s
% 0.38/0.55 # Maximum resident set size: 1708 pages
% 0.38/0.55 % E---3.1 exiting
% 0.38/0.55 % E exiting
%------------------------------------------------------------------------------