TSTP Solution File: FLD005-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD005-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:24 EDT 2023
% Result : Unsatisfiable 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 11 unt; 0 nHn; 26 RR)
% Number of literals : 49 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',existence_of_identity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',b_is_defined) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',existence_of_inverse_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',a_is_defined) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',transitivity_of_equality) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',compatibility_of_equality_and_addition) ).
cnf(associativity_addition,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',associativity_addition) ).
cnf(add_not_equal_to_b_3,negated_conjecture,
~ equalish(add(a,X1),b),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',add_not_equal_to_b_3) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xQpdDK1sac/E---3.1_26796.p',well_definedness_of_additive_inverse) ).
cnf(c_0_9,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_10,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_11,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_12,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_13,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_14,hypothesis,
equalish(add(additive_identity,b),b),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_16,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
( equalish(add(add(a,additive_inverse(a)),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
equalish(add(add(a,additive_inverse(a)),b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10])]) ).
cnf(c_0_20,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(add(a,additive_inverse(a)),b)) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_21,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_addition ).
cnf(c_0_22,negated_conjecture,
~ equalish(add(a,X1),b),
add_not_equal_to_b_3 ).
cnf(c_0_23,hypothesis,
~ defined(additive_inverse(a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_10]),c_0_12])]),c_0_22]) ).
cnf(c_0_24,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : FLD005-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n008.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 23:24:13 EDT 2023
% 0.09/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.xQpdDK1sac/E---3.1_26796.p
% 0.14/0.49 # Version: 3.1pre001
% 0.14/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # sh5l with pid 26876 completed with status 0
% 0.14/0.49 # Result found by sh5l
% 0.14/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.49 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.14/0.49 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.14/0.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 26883 completed with status 0
% 0.14/0.49 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.14/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.49 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.14/0.49 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.14/0.49 # Preprocessing time : 0.001 s
% 0.14/0.49 # Presaturation interreduction done
% 0.14/0.49
% 0.14/0.49 # Proof found!
% 0.14/0.49 # SZS status Unsatisfiable
% 0.14/0.49 # SZS output start CNFRefutation
% See solution above
% 0.14/0.49 # Parsed axioms : 30
% 0.14/0.49 # Removed by relevancy pruning/SinE : 0
% 0.14/0.49 # Initial clauses : 30
% 0.14/0.49 # Removed in clause preprocessing : 0
% 0.14/0.49 # Initial clauses in saturation : 30
% 0.14/0.49 # Processed clauses : 1193
% 0.14/0.49 # ...of these trivial : 20
% 0.14/0.49 # ...subsumed : 422
% 0.14/0.49 # ...remaining for further processing : 751
% 0.14/0.49 # Other redundant clauses eliminated : 0
% 0.14/0.49 # Clauses deleted for lack of memory : 0
% 0.14/0.49 # Backward-subsumed : 138
% 0.14/0.49 # Backward-rewritten : 0
% 0.14/0.49 # Generated clauses : 3929
% 0.14/0.49 # ...of the previous two non-redundant : 3300
% 0.14/0.49 # ...aggressively subsumed : 0
% 0.14/0.49 # Contextual simplify-reflections : 2
% 0.14/0.49 # Paramodulations : 3913
% 0.14/0.49 # Factorizations : 16
% 0.14/0.49 # NegExts : 0
% 0.14/0.49 # Equation resolutions : 0
% 0.14/0.49 # Total rewrite steps : 1197
% 0.14/0.49 # Propositional unsat checks : 0
% 0.14/0.49 # Propositional check models : 0
% 0.14/0.49 # Propositional check unsatisfiable : 0
% 0.14/0.49 # Propositional clauses : 0
% 0.14/0.49 # Propositional clauses after purity: 0
% 0.14/0.49 # Propositional unsat core size : 0
% 0.14/0.49 # Propositional preprocessing time : 0.000
% 0.14/0.49 # Propositional encoding time : 0.000
% 0.14/0.49 # Propositional solver time : 0.000
% 0.14/0.49 # Success case prop preproc time : 0.000
% 0.14/0.49 # Success case prop encoding time : 0.000
% 0.14/0.49 # Success case prop solver time : 0.000
% 0.14/0.49 # Current number of processed clauses : 583
% 0.14/0.49 # Positive orientable unit clauses : 160
% 0.14/0.49 # Positive unorientable unit clauses: 0
% 0.14/0.49 # Negative unit clauses : 6
% 0.14/0.49 # Non-unit-clauses : 417
% 0.14/0.49 # Current number of unprocessed clauses: 2140
% 0.14/0.49 # ...number of literals in the above : 5970
% 0.14/0.49 # Current number of archived formulas : 0
% 0.14/0.49 # Current number of archived clauses : 168
% 0.14/0.49 # Clause-clause subsumption calls (NU) : 31478
% 0.14/0.49 # Rec. Clause-clause subsumption calls : 25463
% 0.14/0.49 # Non-unit clause-clause subsumptions : 425
% 0.14/0.49 # Unit Clause-clause subsumption calls : 1757
% 0.14/0.49 # Rewrite failures with RHS unbound : 0
% 0.14/0.49 # BW rewrite match attempts : 25
% 0.14/0.49 # BW rewrite match successes : 0
% 0.14/0.49 # Condensation attempts : 0
% 0.14/0.49 # Condensation successes : 0
% 0.14/0.49 # Termbank termtop insertions : 51824
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.078 s
% 0.14/0.49 # System time : 0.005 s
% 0.14/0.49 # Total time : 0.083 s
% 0.14/0.49 # Maximum resident set size: 1608 pages
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.080 s
% 0.14/0.49 # System time : 0.005 s
% 0.14/0.49 # Total time : 0.086 s
% 0.14/0.49 # Maximum resident set size: 1692 pages
% 0.14/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------