TSTP Solution File: FLD067-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD067-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:30:15 EDT 2023
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 9 unt; 0 nHn; 18 RR)
% Number of literals : 32 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',compatibility_of_order_relation_and_addition) ).
cnf(sum_5,negated_conjecture,
sum(b,additive_inverse(a),u),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',sum_5) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',less_or_equal_4) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',commutativity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',existence_of_inverse_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',a_is_defined) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/tmp/tmp.HzC4PWBkgm/E---3.1_29630.p',not_less_or_equal_6) ).
cnf(c_0_7,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_8,negated_conjecture,
sum(b,additive_inverse(a),u),
sum_5 ).
cnf(c_0_9,negated_conjecture,
( less_or_equal(X1,u)
| ~ less_or_equal(X2,b)
| ~ sum(X2,additive_inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_11,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_12,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_13,negated_conjecture,
( less_or_equal(X1,u)
| ~ sum(a,additive_inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( sum(X1,additive_inverse(X1),additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_16,negated_conjecture,
~ less_or_equal(additive_identity,u),
not_less_or_equal_6 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : FLD067-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n002.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 23:37:14 EDT 2023
% 0.23/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.HzC4PWBkgm/E---3.1_29630.p
% 0.23/0.53 # Version: 3.1pre001
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # sh5l with pid 29713 completed with status 0
% 0.23/0.53 # Result found by sh5l
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.23/0.53 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 29716 completed with status 0
% 0.23/0.53 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 32
% 0.23/0.53 # Removed by relevancy pruning/SinE : 2
% 0.23/0.53 # Initial clauses : 30
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 30
% 0.23/0.53 # Processed clauses : 42
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 4
% 0.23/0.53 # ...remaining for further processing : 38
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 0
% 0.23/0.53 # Generated clauses : 65
% 0.23/0.53 # ...of the previous two non-redundant : 57
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 63
% 0.23/0.53 # Factorizations : 2
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Total rewrite steps : 18
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 38
% 0.23/0.53 # Positive orientable unit clauses : 8
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 2
% 0.23/0.53 # Non-unit-clauses : 28
% 0.23/0.53 # Current number of unprocessed clauses: 45
% 0.23/0.53 # ...number of literals in the above : 183
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 0
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 72
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 68
% 0.23/0.53 # Non-unit clause-clause subsumptions : 4
% 0.23/0.53 # Unit Clause-clause subsumption calls : 0
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 0
% 0.23/0.53 # BW rewrite match successes : 0
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 1430
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.004 s
% 0.23/0.53 # System time : 0.002 s
% 0.23/0.53 # Total time : 0.005 s
% 0.23/0.53 # Maximum resident set size: 1600 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.005 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.009 s
% 0.23/0.53 # Maximum resident set size: 1700 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------