TSTP Solution File: KLE065+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE065+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:51 EDT 2023
% Result : Theorem 0.40s 0.99s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 18 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 1 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',domain1) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',domain2) ).
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,domain(X5)) = zero ),
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',goals) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',additive_identity) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox2/tmp/tmp.gvB1mGMpXY/E---3.1_15071.p',domain4) ).
fof(c_0_6,plain,
! [X20] : addition(X20,multiplication(domain(X20),X20)) = multiplication(domain(X20),X20),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_7,plain,
! [X21,X22] : domain(multiplication(X21,X22)) = domain(multiplication(X21,domain(X22))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,domain(X5)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_9,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,domain(esk2_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X10] : multiplication(zero,X10) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_13,plain,
! [X8] : addition(X8,zero) = X8,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_14,plain,
addition(multiplication(X1,domain(X2)),multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))) = multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
cnf(c_0_17,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_16]),c_0_17]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE065+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 04:58:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.50 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.gvB1mGMpXY/E---3.1_15071.p
% 0.40/0.99 # Version: 3.1pre001
% 0.40/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.99 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.99 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.99 # Starting sh5l with 300s (1) cores
% 0.40/0.99 # new_bool_3 with pid 15149 completed with status 0
% 0.40/0.99 # Result found by new_bool_3
% 0.40/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.99 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.99 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.40/0.99 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.99 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.40/0.99 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 15152 completed with status 0
% 0.40/0.99 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.40/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.99 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.99 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.40/0.99 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.99 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.40/0.99 # Preprocessing time : 0.001 s
% 0.40/0.99 # Presaturation interreduction done
% 0.40/0.99
% 0.40/0.99 # Proof found!
% 0.40/0.99 # SZS status Theorem
% 0.40/0.99 # SZS output start CNFRefutation
% See solution above
% 0.40/0.99 # Parsed axioms : 18
% 0.40/0.99 # Removed by relevancy pruning/SinE : 4
% 0.40/0.99 # Initial clauses : 15
% 0.40/0.99 # Removed in clause preprocessing : 0
% 0.40/0.99 # Initial clauses in saturation : 15
% 0.40/0.99 # Processed clauses : 182
% 0.40/0.99 # ...of these trivial : 63
% 0.40/0.99 # ...subsumed : 55
% 0.40/0.99 # ...remaining for further processing : 64
% 0.40/0.99 # Other redundant clauses eliminated : 0
% 0.40/0.99 # Clauses deleted for lack of memory : 0
% 0.40/0.99 # Backward-subsumed : 0
% 0.40/0.99 # Backward-rewritten : 1
% 0.40/0.99 # Generated clauses : 1055
% 0.40/0.99 # ...of the previous two non-redundant : 695
% 0.40/0.99 # ...aggressively subsumed : 0
% 0.40/0.99 # Contextual simplify-reflections : 0
% 0.40/0.99 # Paramodulations : 1055
% 0.40/0.99 # Factorizations : 0
% 0.40/0.99 # NegExts : 0
% 0.40/0.99 # Equation resolutions : 0
% 0.40/0.99 # Total rewrite steps : 1222
% 0.40/0.99 # Propositional unsat checks : 0
% 0.40/0.99 # Propositional check models : 0
% 0.40/0.99 # Propositional check unsatisfiable : 0
% 0.40/0.99 # Propositional clauses : 0
% 0.40/0.99 # Propositional clauses after purity: 0
% 0.40/0.99 # Propositional unsat core size : 0
% 0.40/0.99 # Propositional preprocessing time : 0.000
% 0.40/0.99 # Propositional encoding time : 0.000
% 0.40/0.99 # Propositional solver time : 0.000
% 0.40/0.99 # Success case prop preproc time : 0.000
% 0.40/0.99 # Success case prop encoding time : 0.000
% 0.40/0.99 # Success case prop solver time : 0.000
% 0.40/0.99 # Current number of processed clauses : 48
% 0.40/0.99 # Positive orientable unit clauses : 43
% 0.40/0.99 # Positive unorientable unit clauses: 4
% 0.40/0.99 # Negative unit clauses : 1
% 0.40/0.99 # Non-unit-clauses : 0
% 0.40/0.99 # Current number of unprocessed clauses: 526
% 0.40/0.99 # ...number of literals in the above : 526
% 0.40/0.99 # Current number of archived formulas : 0
% 0.40/0.99 # Current number of archived clauses : 16
% 0.40/0.99 # Clause-clause subsumption calls (NU) : 0
% 0.40/0.99 # Rec. Clause-clause subsumption calls : 0
% 0.40/0.99 # Non-unit clause-clause subsumptions : 0
% 0.40/0.99 # Unit Clause-clause subsumption calls : 19
% 0.40/0.99 # Rewrite failures with RHS unbound : 0
% 0.40/0.99 # BW rewrite match attempts : 104
% 0.40/0.99 # BW rewrite match successes : 91
% 0.40/0.99 # Condensation attempts : 0
% 0.40/0.99 # Condensation successes : 0
% 0.40/0.99 # Termbank termtop insertions : 12320
% 0.40/0.99
% 0.40/0.99 # -------------------------------------------------
% 0.40/0.99 # User time : 0.015 s
% 0.40/0.99 # System time : 0.002 s
% 0.40/0.99 # Total time : 0.017 s
% 0.40/0.99 # Maximum resident set size: 1620 pages
% 0.40/0.99
% 0.40/0.99 # -------------------------------------------------
% 0.40/0.99 # User time : 0.017 s
% 0.40/0.99 # System time : 0.003 s
% 0.40/0.99 # Total time : 0.020 s
% 0.40/0.99 # Maximum resident set size: 1692 pages
% 0.40/0.99 % E---3.1 exiting
%------------------------------------------------------------------------------