TSTP Solution File: KLE119+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE119+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:05:01 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 38 unt; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 3 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',multiplicative_left_identity) ).
fof(codomain1,axiom,
! [X4] : multiplication(X4,coantidomain(X4)) = zero,
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',codomain1) ).
fof(codomain4,axiom,
! [X4] : codomain(X4) = coantidomain(coantidomain(X4)),
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',codomain4) ).
fof(codomain3,axiom,
! [X4] : addition(coantidomain(coantidomain(X4)),coantidomain(X4)) = one,
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',codomain3) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',additive_identity) ).
fof(goals,conjecture,
! [X4,X5] : addition(backward_diamond(zero,domain(X4)),domain(X5)) = domain(X5),
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',goals) ).
fof(backward_diamond,axiom,
! [X4,X5] : backward_diamond(X4,X5) = codomain(multiplication(codomain(X5),X4)),
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',backward_diamond) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',right_annihilation) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.llHjgvL4RB/E---3.1_29051.p',additive_commutativity) ).
fof(c_0_9,plain,
! [X39] : multiplication(one,X39) = X39,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_10,plain,
! [X27] : multiplication(X27,coantidomain(X27)) = zero,
inference(variable_rename,[status(thm)],[codomain1]) ).
fof(c_0_11,plain,
! [X34] : codomain(X34) = coantidomain(coantidomain(X34)),
inference(variable_rename,[status(thm)],[codomain4]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
multiplication(X1,coantidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X37] : addition(coantidomain(coantidomain(X37)),coantidomain(X37)) = one,
inference(variable_rename,[status(thm)],[codomain3]) ).
cnf(c_0_15,plain,
codomain(X1) = coantidomain(coantidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
coantidomain(one) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X23] : addition(X23,zero) = X23,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_19,negated_conjecture,
~ ! [X4,X5] : addition(backward_diamond(zero,domain(X4)),domain(X5)) = domain(X5),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_20,plain,
! [X21,X22] : backward_diamond(X21,X22) = codomain(multiplication(codomain(X22),X21)),
inference(variable_rename,[status(thm)],[backward_diamond]) ).
fof(c_0_21,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_22,plain,
coantidomain(zero) = codomain(one),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
addition(codomain(X1),coantidomain(X1)) = one,
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_24,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,negated_conjecture,
addition(backward_diamond(zero,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_19])])]) ).
fof(c_0_26,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_27,plain,
backward_diamond(X1,X2) = codomain(multiplication(codomain(X2),X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
coantidomain(codomain(one)) = codomain(zero),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_30,plain,
codomain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
addition(backward_diamond(zero,domain(esk1_0)),domain(esk2_0)) != domain(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
codomain(zero) = backward_diamond(zero,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
codomain(zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_16]) ).
cnf(c_0_35,negated_conjecture,
addition(domain(esk2_0),backward_diamond(zero,domain(esk1_0))) != domain(esk2_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
backward_diamond(zero,X1) = zero,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE119+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n011.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 04:51:38 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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.llHjgvL4RB/E---3.1_29051.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 # new_bool_1 with pid 29131 completed with status 0
% 0.22/0.53 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.22/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 29133 completed with status 0
% 0.22/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (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 : 27
% 0.22/0.53 # Removed by relevancy pruning/SinE : 6
% 0.22/0.53 # Initial clauses : 21
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 21
% 0.22/0.53 # Processed clauses : 62
% 0.22/0.53 # ...of these trivial : 4
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 58
% 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 : 16
% 0.22/0.53 # Generated clauses : 81
% 0.22/0.53 # ...of the previous two non-redundant : 74
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 81
% 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 : 90
% 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 : 21
% 0.22/0.53 # Positive orientable unit clauses : 20
% 0.22/0.53 # Positive unorientable unit clauses: 1
% 0.22/0.53 # Negative unit clauses : 0
% 0.22/0.53 # Non-unit-clauses : 0
% 0.22/0.53 # Current number of unprocessed clauses: 51
% 0.22/0.53 # ...number of literals in the above : 51
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 37
% 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 : 3
% 0.22/0.53 # BW rewrite match attempts : 28
% 0.22/0.53 # BW rewrite match successes : 25
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 1558
% 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: 1760 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.005 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.009 s
% 0.22/0.53 # Maximum resident set size: 1692 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------