TSTP Solution File: KLE059+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE059+1 : TPTP v8.1.2. Released v4.0.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 18:04:50 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 11 unt; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( addition(X4,X5) = X5
=> addition(domain(X4),domain(X5)) = domain(X5) ),
file('/export/starexec/sandbox/tmp/tmp.bfJ0YAdBS0/E---3.1_4769.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.bfJ0YAdBS0/E---3.1_4769.p',additive_commutativity) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/tmp/tmp.bfJ0YAdBS0/E---3.1_4769.p',domain5) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X5] :
( addition(X4,X5) = X5
=> addition(domain(X4),domain(X5)) = domain(X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
( addition(esk1_0,esk2_0) = esk2_0
& addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X13,X14] : addition(X13,X14) = addition(X14,X13),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_6,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X11,X12] : domain(addition(X11,X12)) = addition(domain(X11),domain(X12)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_9,negated_conjecture,
addition(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
addition(domain(esk2_0),domain(esk1_0)) != domain(esk2_0),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
addition(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE059+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n008.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 04:46:27 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.bfJ0YAdBS0/E---3.1_4769.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 # new_bool_3 with pid 4847 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.41 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.14/0.41 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 4853 completed with status 0
% 0.14/0.41 # Result found by H----_047_C09_12_F1_AE_ND_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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.41 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 18
% 0.14/0.41 # Removed by relevancy pruning/SinE : 4
% 0.14/0.41 # Initial clauses : 15
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 15
% 0.14/0.41 # Processed clauses : 13
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 13
% 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 : 3
% 0.14/0.41 # Generated clauses : 0
% 0.14/0.41 # ...of the previous two non-redundant : 2
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 0
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 4
% 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 : 10
% 0.14/0.41 # Positive orientable unit clauses : 9
% 0.14/0.41 # Positive unorientable unit clauses: 1
% 0.14/0.41 # Negative unit clauses : 0
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 4
% 0.14/0.41 # ...number of literals in the above : 4
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 3
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 0
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 12
% 0.14/0.41 # BW rewrite match successes : 9
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 538
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.000 s
% 0.14/0.41 # Total time : 0.004 s
% 0.14/0.41 # Maximum resident set size: 1756 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.001 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1684 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------