TSTP Solution File: FLD058-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD058-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:43 EDT 2023
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 22 RR)
% Number of literals : 38 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',symmetry_of_equality) ).
cnf(b_equals_additive_identity_6,negated_conjecture,
equalish(b,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',b_equals_additive_identity_6) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',compatibility_of_equality_and_order_relation) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',less_or_equal_3) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',transitivity_of_equality) ).
cnf(antisymmetry_of_order_relation,axiom,
( equalish(X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',antisymmetry_of_order_relation) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',less_or_equal_4) ).
cnf(a_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.SbQO3YqCxl/E---3.1_12201.p',a_not_equal_to_additive_identity_5) ).
cnf(c_0_8,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_9,negated_conjecture,
equalish(b,additive_identity),
b_equals_additive_identity_6 ).
cnf(c_0_10,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_11,negated_conjecture,
equalish(additive_identity,b),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( less_or_equal(b,X1)
| ~ less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_14,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_15,axiom,
( equalish(X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_16,negated_conjecture,
less_or_equal(b,a),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_18,negated_conjecture,
( equalish(X1,additive_identity)
| ~ equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
equalish(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_5 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : FLD058-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 23:01:43 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.SbQO3YqCxl/E---3.1_12201.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # sh5l with pid 12281 completed with status 0
% 0.14/0.41 # Result found by sh5l
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.14/0.41 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 12287 completed with status 0
% 0.14/0.41 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 33
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 33
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 33
% 0.14/0.41 # Processed clauses : 50
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 1
% 0.14/0.41 # ...remaining for further processing : 49
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 1
% 0.14/0.41 # Generated clauses : 137
% 0.14/0.41 # ...of the previous two non-redundant : 111
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 135
% 0.14/0.41 # Factorizations : 2
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 44
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 48
% 0.14/0.41 # Positive orientable unit clauses : 15
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 3
% 0.14/0.41 # Non-unit-clauses : 30
% 0.14/0.41 # Current number of unprocessed clauses: 90
% 0.14/0.41 # ...number of literals in the above : 282
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 1
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 100
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 90
% 0.14/0.41 # Non-unit clause-clause subsumptions : 1
% 0.14/0.41 # Unit Clause-clause subsumption calls : 2
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 1
% 0.14/0.41 # BW rewrite match successes : 1
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2129
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.000 s
% 0.14/0.41 # Total time : 0.005 s
% 0.14/0.41 # Maximum resident set size: 1624 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.008 s
% 0.14/0.41 # Maximum resident set size: 1696 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------