TSTP Solution File: HEN003-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HEN003-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:52 EDT 2024
% Result : Unsatisfiable 0.45s 0.55s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 18 unt; 0 nHn; 13 RR)
% Number of literals : 39 ( 18 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(prove_x_divide_x_is_zero,negated_conjecture,
divide(a,a) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divide_x_is_zero) ).
cnf(c_0_8,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_9,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_11,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_12,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_13,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
c_0_11 ).
cnf(c_0_15,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_17,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_18,plain,
divide(divide(X1,X1),divide(X2,X1)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_20,plain,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
c_0_17 ).
cnf(c_0_21,plain,
divide(divide(X1,X1),zero) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
divide(a,a) != zero,
inference(fof_simplification,[status(thm)],[prove_x_divide_x_is_zero]) ).
cnf(c_0_23,plain,
less_equal(divide(X1,X1),zero),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
divide(a,a) != zero,
c_0_22 ).
cnf(c_0_25,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_16])]) ).
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.04/0.14 % Problem : HEN003-4 : TPTP v8.2.0. Released v1.0.0.
% 0.16/0.16 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n024.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sun May 19 22:49:08 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.40/0.54 Running first-order model finding
% 0.40/0.54 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.45/0.55 # Version: 3.1.0
% 0.45/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.45/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.45/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.45/0.55 # Starting sh5l with 300s (1) cores
% 0.45/0.55 # new_bool_3 with pid 24442 completed with status 0
% 0.45/0.55 # Result found by new_bool_3
% 0.45/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.45/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.45/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.55 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.45/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.55 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.45/0.55 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 24446 completed with status 0
% 0.45/0.55 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.45/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.45/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.45/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.55 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.45/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.55 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.45/0.55 # Preprocessing time : 0.001 s
% 0.45/0.55 # Presaturation interreduction done
% 0.45/0.55
% 0.45/0.55 # Proof found!
% 0.45/0.55 # SZS status Unsatisfiable
% 0.45/0.55 # SZS output start CNFRefutation
% See solution above
% 0.45/0.55 # Parsed axioms : 10
% 0.45/0.55 # Removed by relevancy pruning/SinE : 2
% 0.45/0.55 # Initial clauses : 8
% 0.45/0.55 # Removed in clause preprocessing : 0
% 0.45/0.55 # Initial clauses in saturation : 8
% 0.45/0.55 # Processed clauses : 27
% 0.45/0.55 # ...of these trivial : 1
% 0.45/0.55 # ...subsumed : 1
% 0.45/0.55 # ...remaining for further processing : 25
% 0.45/0.55 # Other redundant clauses eliminated : 0
% 0.45/0.55 # Clauses deleted for lack of memory : 0
% 0.45/0.55 # Backward-subsumed : 0
% 0.45/0.55 # Backward-rewritten : 5
% 0.45/0.55 # Generated clauses : 103
% 0.45/0.55 # ...of the previous two non-redundant : 44
% 0.45/0.55 # ...aggressively subsumed : 0
% 0.45/0.55 # Contextual simplify-reflections : 0
% 0.45/0.55 # Paramodulations : 103
% 0.45/0.55 # Factorizations : 0
% 0.45/0.55 # NegExts : 0
% 0.45/0.55 # Equation resolutions : 0
% 0.45/0.55 # Disequality decompositions : 0
% 0.45/0.55 # Total rewrite steps : 96
% 0.45/0.55 # ...of those cached : 57
% 0.45/0.55 # Propositional unsat checks : 0
% 0.45/0.55 # Propositional check models : 0
% 0.45/0.55 # Propositional check unsatisfiable : 0
% 0.45/0.55 # Propositional clauses : 0
% 0.45/0.55 # Propositional clauses after purity: 0
% 0.45/0.55 # Propositional unsat core size : 0
% 0.45/0.55 # Propositional preprocessing time : 0.000
% 0.45/0.55 # Propositional encoding time : 0.000
% 0.45/0.55 # Propositional solver time : 0.000
% 0.45/0.55 # Success case prop preproc time : 0.000
% 0.45/0.55 # Success case prop encoding time : 0.000
% 0.45/0.55 # Success case prop solver time : 0.000
% 0.45/0.55 # Current number of processed clauses : 12
% 0.45/0.55 # Positive orientable unit clauses : 7
% 0.45/0.55 # Positive unorientable unit clauses: 0
% 0.45/0.55 # Negative unit clauses : 0
% 0.45/0.55 # Non-unit-clauses : 5
% 0.45/0.55 # Current number of unprocessed clauses: 33
% 0.45/0.55 # ...number of literals in the above : 37
% 0.45/0.55 # Current number of archived formulas : 0
% 0.45/0.55 # Current number of archived clauses : 13
% 0.45/0.55 # Clause-clause subsumption calls (NU) : 3
% 0.45/0.55 # Rec. Clause-clause subsumption calls : 3
% 0.45/0.55 # Non-unit clause-clause subsumptions : 1
% 0.45/0.55 # Unit Clause-clause subsumption calls : 1
% 0.45/0.55 # Rewrite failures with RHS unbound : 0
% 0.45/0.55 # BW rewrite match attempts : 13
% 0.45/0.55 # BW rewrite match successes : 3
% 0.45/0.55 # Condensation attempts : 0
% 0.45/0.55 # Condensation successes : 0
% 0.45/0.55 # Termbank termtop insertions : 1057
% 0.45/0.55 # Search garbage collected termcells : 15
% 0.45/0.55
% 0.45/0.55 # -------------------------------------------------
% 0.45/0.55 # User time : 0.004 s
% 0.45/0.55 # System time : 0.001 s
% 0.45/0.55 # Total time : 0.005 s
% 0.45/0.55 # Maximum resident set size: 1620 pages
% 0.45/0.55
% 0.45/0.55 # -------------------------------------------------
% 0.45/0.55 # User time : 0.006 s
% 0.45/0.55 # System time : 0.003 s
% 0.45/0.55 # Total time : 0.009 s
% 0.45/0.55 # Maximum resident set size: 1700 pages
% 0.45/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------