TSTP Solution File: KLE002+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE002+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:34 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 24 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 4 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( leq(X4,X5)
=> leq(multiplication(X4,X6),multiplication(X5,X6)) ),
file('/export/starexec/sandbox2/tmp/tmp.IUenL6sYXH/E---3.1_27590.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.IUenL6sYXH/E---3.1_27590.p',order) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.IUenL6sYXH/E---3.1_27590.p',left_distributivity) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X5,X6] :
( leq(X4,X5)
=> leq(multiplication(X4,X6),multiplication(X5,X6)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
( leq(esk1_0,esk2_0)
& ~ leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X27,X28] :
( ( ~ leq(X27,X28)
| addition(X27,X28) = X28 )
& ( addition(X27,X28) != X28
| leq(X27,X28) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_6,negated_conjecture,
~ leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_9,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
leq(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
addition(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)) != multiplication(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
addition(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : KLE002+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n029.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 : Tue Oct 3 05:07:07 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.IUenL6sYXH/E---3.1_27590.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27667 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53 # Starting sh5l with 136s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27672 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 13
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 15
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 15
% 0.22/0.53 # Processed clauses : 32
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 32
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 1
% 0.22/0.53 # Generated clauses : 53
% 0.22/0.53 # ...of the previous two non-redundant : 18
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 53
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Total rewrite steps : 46
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 16
% 0.22/0.53 # Positive orientable unit clauses : 12
% 0.22/0.53 # Positive unorientable unit clauses: 1
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 2
% 0.22/0.53 # Current number of unprocessed clauses: 16
% 0.22/0.53 # ...number of literals in the above : 16
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 16
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 0
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 21
% 0.22/0.53 # BW rewrite match successes : 17
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 945
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.005 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.006 s
% 0.22/0.53 # Maximum resident set size: 1716 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.014 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.020 s
% 0.22/0.53 # Maximum resident set size: 1688 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------