TSTP Solution File: HEN009-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:50:52 EDT 2023
% Result : Unsatisfiable 0.67s 0.53s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 24 unt; 0 nHn; 29 RR)
% Number of literals : 59 ( 20 equ; 22 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(property_of_divide3,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',property_of_divide3) ).
cnf(id_divide_a_is_b,hypothesis,
divide(identity,a) = b,
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',id_divide_a_is_b) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',identity_is_largest) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',property_of_divide1) ).
cnf(id_divide_b_is_c,hypothesis,
divide(identity,b) = c,
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',id_divide_b_is_c) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',less_equal_and_equal) ).
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',quotient_less_equal1) ).
cnf(id_divide_c_is_d,hypothesis,
divide(identity,c) = d,
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',id_divide_c_is_d) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',quotient_less_equal2) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',zero_is_smallest) ).
cnf(prove_b_equals_d,negated_conjecture,
b != d,
file('/export/starexec/sandbox/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p',prove_b_equals_d) ).
cnf(c_0_11,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
property_of_divide3 ).
cnf(c_0_12,hypothesis,
divide(identity,a) = b,
id_divide_a_is_b ).
cnf(c_0_13,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_14,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_15,hypothesis,
less_equal(divide(X1,a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
( less_equal(divide(identity,X1),a)
| ~ less_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_17,hypothesis,
divide(identity,b) = c,
id_divide_b_is_c ).
cnf(c_0_18,hypothesis,
less_equal(b,b),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_20,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_21,hypothesis,
less_equal(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,hypothesis,
divide(identity,c) = d,
id_divide_c_is_d ).
cnf(c_0_23,hypothesis,
less_equal(divide(X1,b),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_13])]) ).
cnf(c_0_24,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_25,plain,
( divide(X1,X2) = divide(X3,X2)
| ~ less_equal(divide(X1,X2),divide(X3,X2))
| ~ less_equal(X3,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_26,hypothesis,
divide(c,a) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_28,hypothesis,
less_equal(divide(X1,c),d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_13])]) ).
cnf(c_0_29,hypothesis,
( less_equal(divide(identity,X1),b)
| ~ less_equal(c,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_30,hypothesis,
less_equal(c,c),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_31,plain,
( less_equal(divide(X1,X2),X3)
| divide(divide(X1,X3),X2) != zero ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_32,hypothesis,
( divide(X1,a) = zero
| ~ less_equal(X1,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,hypothesis,
less_equal(divide(X1,d),c),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_34,hypothesis,
less_equal(d,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
b != d,
prove_b_equals_d ).
cnf(c_0_36,hypothesis,
( less_equal(b,X1)
| divide(divide(identity,X1),a) != zero ),
inference(spm,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_37,hypothesis,
divide(divide(X1,d),a) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,hypothesis,
~ less_equal(b,d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_35]) ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n031.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 11:49:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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/tmp/tmp.PPY7JWSpUA/E---3.1_26172.p
% 0.67/0.53 # Version: 3.1pre001
% 0.67/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.67/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.67/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.67/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.67/0.53 # Starting sh5l with 300s (1) cores
% 0.67/0.53 # sh5l with pid 26253 completed with status 0
% 0.67/0.53 # Result found by sh5l
% 0.67/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.67/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.67/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.67/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.67/0.53 # Starting sh5l with 300s (1) cores
% 0.67/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.67/0.53 # Search class: FHUSM-FFSS22-MFFFFFNN
% 0.67/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.67/0.53 # SAT001_MinMin_p005000_rr_RG with pid 26260 completed with status 0
% 0.67/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.67/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.67/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.67/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.67/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.67/0.53 # Starting sh5l with 300s (1) cores
% 0.67/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.67/0.53 # Search class: FHUSM-FFSS22-MFFFFFNN
% 0.67/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.67/0.53 # Preprocessing time : 0.001 s
% 0.67/0.53 # Presaturation interreduction done
% 0.67/0.53
% 0.67/0.53 # Proof found!
% 0.67/0.53 # SZS status Unsatisfiable
% 0.67/0.53 # SZS output start CNFRefutation
% See solution above
% 0.67/0.53 # Parsed axioms : 17
% 0.67/0.53 # Removed by relevancy pruning/SinE : 0
% 0.67/0.53 # Initial clauses : 17
% 0.67/0.53 # Removed in clause preprocessing : 0
% 0.67/0.53 # Initial clauses in saturation : 17
% 0.67/0.53 # Processed clauses : 1018
% 0.67/0.53 # ...of these trivial : 10
% 0.67/0.53 # ...subsumed : 684
% 0.67/0.53 # ...remaining for further processing : 324
% 0.67/0.53 # Other redundant clauses eliminated : 0
% 0.67/0.53 # Clauses deleted for lack of memory : 0
% 0.67/0.53 # Backward-subsumed : 79
% 0.67/0.53 # Backward-rewritten : 5
% 0.67/0.53 # Generated clauses : 4984
% 0.67/0.53 # ...of the previous two non-redundant : 2923
% 0.67/0.53 # ...aggressively subsumed : 0
% 0.67/0.53 # Contextual simplify-reflections : 1
% 0.67/0.53 # Paramodulations : 4984
% 0.67/0.53 # Factorizations : 0
% 0.67/0.53 # NegExts : 0
% 0.67/0.53 # Equation resolutions : 0
% 0.67/0.53 # Total rewrite steps : 5105
% 0.67/0.53 # Propositional unsat checks : 0
% 0.67/0.53 # Propositional check models : 0
% 0.67/0.53 # Propositional check unsatisfiable : 0
% 0.67/0.53 # Propositional clauses : 0
% 0.67/0.53 # Propositional clauses after purity: 0
% 0.67/0.53 # Propositional unsat core size : 0
% 0.67/0.53 # Propositional preprocessing time : 0.000
% 0.67/0.53 # Propositional encoding time : 0.000
% 0.67/0.53 # Propositional solver time : 0.000
% 0.67/0.53 # Success case prop preproc time : 0.000
% 0.67/0.53 # Success case prop encoding time : 0.000
% 0.67/0.53 # Success case prop solver time : 0.000
% 0.67/0.53 # Current number of processed clauses : 224
% 0.67/0.53 # Positive orientable unit clauses : 71
% 0.67/0.53 # Positive unorientable unit clauses: 0
% 0.67/0.53 # Negative unit clauses : 44
% 0.67/0.53 # Non-unit-clauses : 109
% 0.67/0.53 # Current number of unprocessed clauses: 1832
% 0.67/0.53 # ...number of literals in the above : 3473
% 0.67/0.53 # Current number of archived formulas : 0
% 0.67/0.53 # Current number of archived clauses : 100
% 0.67/0.53 # Clause-clause subsumption calls (NU) : 819
% 0.67/0.53 # Rec. Clause-clause subsumption calls : 807
% 0.67/0.53 # Non-unit clause-clause subsumptions : 235
% 0.67/0.53 # Unit Clause-clause subsumption calls : 694
% 0.67/0.53 # Rewrite failures with RHS unbound : 0
% 0.67/0.53 # BW rewrite match attempts : 52
% 0.67/0.53 # BW rewrite match successes : 2
% 0.67/0.53 # Condensation attempts : 0
% 0.67/0.53 # Condensation successes : 0
% 0.67/0.53 # Termbank termtop insertions : 47374
% 0.67/0.53
% 0.67/0.53 # -------------------------------------------------
% 0.67/0.53 # User time : 0.056 s
% 0.67/0.53 # System time : 0.003 s
% 0.67/0.53 # Total time : 0.059 s
% 0.67/0.53 # Maximum resident set size: 1632 pages
% 0.67/0.53
% 0.67/0.53 # -------------------------------------------------
% 0.67/0.53 # User time : 0.057 s
% 0.67/0.53 # System time : 0.006 s
% 0.67/0.53 # Total time : 0.062 s
% 0.67/0.53 # Maximum resident set size: 1680 pages
% 0.67/0.53 % E---3.1 exiting
% 0.67/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------