TSTP Solution File: HEN009-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN009-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 29 ( 6 equ; 13 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(property_of_divide3,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',property_of_divide3) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',identity_is_largest) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',property_of_divide1) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',less_equal_and_equal) ).
cnf(property_of_divide2,axiom,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',property_of_divide2) ).
cnf(prove_this,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p',prove_this) ).
cnf(c_0_6,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
property_of_divide3 ).
cnf(c_0_7,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_8,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_9,plain,
less_equal(divide(X1,X2),divide(identity,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_11,plain,
less_equal(divide(X1,divide(identity,X2)),X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( less_equal(divide(X3,X2),divide(X3,X1))
| ~ less_equal(X1,X2) ),
property_of_divide2 ).
cnf(c_0_13,plain,
( divide(X1,divide(identity,X2)) = X2
| ~ less_equal(X2,divide(X1,divide(identity,X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
less_equal(divide(X1,X2),divide(X1,divide(X3,divide(identity,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
prove_this ).
cnf(c_0_16,plain,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN009-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:16:46 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.vULVjujvr5/E---3.1_32339.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # sh5l with pid 32420 completed with status 0
% 0.22/0.53 # Result found by sh5l
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 163s (1) cores
% 0.22/0.53 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 32424 completed with status 0
% 0.22/0.53 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FHUSM-FFSF22-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 163s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 16
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 16
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 16
% 0.22/0.53 # Processed clauses : 755
% 0.22/0.53 # ...of these trivial : 27
% 0.22/0.53 # ...subsumed : 616
% 0.22/0.53 # ...remaining for further processing : 112
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 8
% 0.22/0.53 # Backward-rewritten : 22
% 0.22/0.53 # Generated clauses : 3899
% 0.22/0.53 # ...of the previous two non-redundant : 1531
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 3890
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 9
% 0.22/0.53 # Total rewrite steps : 4596
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 82
% 0.22/0.53 # Positive orientable unit clauses : 42
% 0.22/0.53 # Positive unorientable unit clauses: 6
% 0.22/0.53 # Negative unit clauses : 0
% 0.22/0.53 # Non-unit-clauses : 34
% 0.22/0.53 # Current number of unprocessed clauses: 692
% 0.22/0.53 # ...number of literals in the above : 930
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 30
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 607
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 607
% 0.22/0.53 # Non-unit clause-clause subsumptions : 347
% 0.22/0.53 # Unit Clause-clause subsumption calls : 24
% 0.22/0.53 # Rewrite failures with RHS unbound : 117
% 0.22/0.53 # BW rewrite match attempts : 208
% 0.22/0.53 # BW rewrite match successes : 37
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 27506
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.026 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.027 s
% 0.22/0.53 # Maximum resident set size: 1632 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.027 s
% 0.22/0.53 # System time : 0.003 s
% 0.22/0.53 # Total time : 0.030 s
% 0.22/0.53 # Maximum resident set size: 1680 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------