TSTP Solution File: HEN010-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HEN010-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:51:03 EDT 2023
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 20 unt; 0 nHn; 11 RR)
% Number of literals : 38 ( 16 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',quotient_less_equal2) ).
cnf(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',x_divide_x_is_zero) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',less_equal_and_equal) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',zero_is_smallest) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',property_of_divide1) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',quotient_property) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',quotient_smaller_than_numerator) ).
cnf(one_inversion_equals_three,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',one_inversion_equals_three) ).
cnf(prove_property_of_inversion,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p',prove_property_of_inversion) ).
cnf(c_0_9,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_10,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_11,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_12,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_13,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_14,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( X1 = zero
| ~ less_equal(X1,zero) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
less_equal(divide(X1,divide(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
divide(X1,divide(X1,zero)) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_19,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_21,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_22,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),X2) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_22]),c_0_22]),c_0_20])]) ).
cnf(c_0_24,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
one_inversion_equals_three ).
cnf(c_0_25,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
prove_property_of_inversion ).
cnf(c_0_26,plain,
divide(divide(identity,X1),divide(identity,divide(identity,X1))) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN010-4 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.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.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 11:37:14 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.FYhEqzUSZ4/E---3.1_28469.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28594 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.21/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 28602 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (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 : 17
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 17
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 17
% 0.21/0.49 # Processed clauses : 112
% 0.21/0.49 # ...of these trivial : 4
% 0.21/0.49 # ...subsumed : 37
% 0.21/0.49 # ...remaining for further processing : 71
% 0.21/0.49 # Other redundant clauses eliminated : 1
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 2
% 0.21/0.49 # Backward-rewritten : 11
% 0.21/0.49 # Generated clauses : 703
% 0.21/0.49 # ...of the previous two non-redundant : 257
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 702
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 1
% 0.21/0.49 # Total rewrite steps : 825
% 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 : 41
% 0.21/0.49 # Positive orientable unit clauses : 20
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 21
% 0.21/0.49 # Current number of unprocessed clauses: 169
% 0.21/0.49 # ...number of literals in the above : 209
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 30
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 75
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 75
% 0.21/0.49 # Non-unit clause-clause subsumptions : 39
% 0.21/0.49 # Unit Clause-clause subsumption calls : 15
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 44
% 0.21/0.49 # BW rewrite match successes : 7
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 6667
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.007 s
% 0.21/0.49 # System time : 0.005 s
% 0.21/0.49 # Total time : 0.012 s
% 0.21/0.49 # Maximum resident set size: 1596 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.043 s
% 0.21/0.49 # System time : 0.016 s
% 0.21/0.49 # Total time : 0.059 s
% 0.21/0.49 # Maximum resident set size: 1680 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------