TSTP Solution File: FLD023-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD023-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 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:29:58 EDT 2023
% Result : Unsatisfiable 1.64s 0.62s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 40 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',compatibility_of_equality_and_addition) ).
cnf(a_equals_b_3,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',a_equals_b_3) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',well_definedness_of_additive_inverse) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',a_is_defined) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',existence_of_inverse_addition) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',transitivity_of_equality) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',symmetry_of_equality) ).
cnf(additive_identity_not_equal_to_add_4,negated_conjecture,
~ equalish(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/tmp/tmp.ZUwv7Kryzs/E---3.1_31312.p',additive_identity_not_equal_to_add_4) ).
cnf(c_0_8,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_9,negated_conjecture,
equalish(a,b),
a_equals_b_3 ).
cnf(c_0_10,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_11,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_12,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_13,negated_conjecture,
( equalish(add(a,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,hypothesis,
defined(additive_inverse(a)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_16,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_18,hypothesis,
equalish(add(a,additive_inverse(a)),add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
( equalish(X1,additive_identity)
| ~ equalish(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
equalish(add(b,additive_inverse(a)),add(a,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
equalish(add(b,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ equalish(additive_identity,add(b,additive_inverse(a))),
additive_identity_not_equal_to_add_4 ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : FLD023-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n005.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 2400
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Oct 2 23:12:31 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.ZUwv7Kryzs/E---3.1_31312.p
% 1.64/0.62 # Version: 3.1pre001
% 1.64/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.64/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.64/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.64/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.64/0.62 # Starting sh5l with 300s (1) cores
% 1.64/0.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31455 completed with status 0
% 1.64/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.64/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.64/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.64/0.62 # No SInE strategy applied
% 1.64/0.62 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.64/0.62 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.64/0.62 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 1.64/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.64/0.62 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.62 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.62 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 1.64/0.62 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with pid 31469 completed with status 0
% 1.64/0.62 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S
% 1.64/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.64/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.64/0.62 # No SInE strategy applied
% 1.64/0.62 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.64/0.62 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.64/0.62 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 1.64/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.64/0.62 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.62 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.62 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 1.64/0.62 # Preprocessing time : 0.001 s
% 1.64/0.62 # Presaturation interreduction done
% 1.64/0.62
% 1.64/0.62 # Proof found!
% 1.64/0.62 # SZS status Unsatisfiable
% 1.64/0.62 # SZS output start CNFRefutation
% See solution above
% 1.64/0.62 # Parsed axioms : 31
% 1.64/0.62 # Removed by relevancy pruning/SinE : 0
% 1.64/0.62 # Initial clauses : 31
% 1.64/0.62 # Removed in clause preprocessing : 0
% 1.64/0.62 # Initial clauses in saturation : 31
% 1.64/0.62 # Processed clauses : 755
% 1.64/0.62 # ...of these trivial : 55
% 1.64/0.62 # ...subsumed : 0
% 1.64/0.62 # ...remaining for further processing : 700
% 1.64/0.62 # Other redundant clauses eliminated : 0
% 1.64/0.62 # Clauses deleted for lack of memory : 0
% 1.64/0.62 # Backward-subsumed : 0
% 1.64/0.62 # Backward-rewritten : 0
% 1.64/0.62 # Generated clauses : 26136
% 1.64/0.62 # ...of the previous two non-redundant : 25659
% 1.64/0.63 # ...aggressively subsumed : 0
% 1.64/0.63 # Contextual simplify-reflections : 0
% 1.64/0.63 # Paramodulations : 26136
% 1.64/0.63 # Factorizations : 0
% 1.64/0.63 # NegExts : 0
% 1.64/0.63 # Equation resolutions : 0
% 1.64/0.63 # Total rewrite steps : 477
% 1.64/0.63 # Propositional unsat checks : 0
% 1.64/0.63 # Propositional check models : 0
% 1.64/0.63 # Propositional check unsatisfiable : 0
% 1.64/0.63 # Propositional clauses : 0
% 1.64/0.63 # Propositional clauses after purity: 0
% 1.64/0.63 # Propositional unsat core size : 0
% 1.64/0.63 # Propositional preprocessing time : 0.000
% 1.64/0.63 # Propositional encoding time : 0.000
% 1.64/0.63 # Propositional solver time : 0.000
% 1.64/0.63 # Success case prop preproc time : 0.000
% 1.64/0.63 # Success case prop encoding time : 0.000
% 1.64/0.63 # Success case prop solver time : 0.000
% 1.64/0.63 # Current number of processed clauses : 669
% 1.64/0.63 # Positive orientable unit clauses : 441
% 1.64/0.63 # Positive unorientable unit clauses: 0
% 1.64/0.63 # Negative unit clauses : 2
% 1.64/0.63 # Non-unit-clauses : 226
% 1.64/0.63 # Current number of unprocessed clauses: 24966
% 1.64/0.63 # ...number of literals in the above : 32838
% 1.64/0.63 # Current number of archived formulas : 0
% 1.64/0.63 # Current number of archived clauses : 31
% 1.64/0.63 # Clause-clause subsumption calls (NU) : 3028
% 1.64/0.63 # Rec. Clause-clause subsumption calls : 2893
% 1.64/0.63 # Non-unit clause-clause subsumptions : 0
% 1.64/0.63 # Unit Clause-clause subsumption calls : 819
% 1.64/0.63 # Rewrite failures with RHS unbound : 0
% 1.64/0.63 # BW rewrite match attempts : 705
% 1.64/0.63 # BW rewrite match successes : 0
% 1.64/0.63 # Condensation attempts : 0
% 1.64/0.63 # Condensation successes : 0
% 1.64/0.63 # Termbank termtop insertions : 364620
% 1.64/0.63
% 1.64/0.63 # -------------------------------------------------
% 1.64/0.63 # User time : 0.147 s
% 1.64/0.63 # System time : 0.023 s
% 1.64/0.63 # Total time : 0.169 s
% 1.64/0.63 # Maximum resident set size: 1652 pages
% 1.64/0.63
% 1.64/0.63 # -------------------------------------------------
% 1.64/0.63 # User time : 0.794 s
% 1.64/0.63 # System time : 0.048 s
% 1.64/0.63 # Total time : 0.843 s
% 1.64/0.63 # Maximum resident set size: 1696 pages
% 1.64/0.63 % E---3.1 exiting
% 1.64/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------