TSTP Solution File: KLE129+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE129+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:12 EDT 2023
% Result : Theorem 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 16 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 7 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 1 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] :
( divergence(X4) = zero
<= ! [X5] :
( addition(domain(X5),forward_diamond(X4,domain(X5))) = forward_diamond(X4,domain(X5))
=> domain(X5) = zero ) ),
file('/export/starexec/sandbox2/tmp/tmp.NZeDUHLlVP/E---3.1_25874.p',goals) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/tmp/tmp.NZeDUHLlVP/E---3.1_25874.p',forward_diamond) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/tmp/tmp.NZeDUHLlVP/E---3.1_25874.p',domain4) ).
fof(divergence1,axiom,
! [X4] : forward_diamond(X4,divergence(X4)) = divergence(X4),
file('/export/starexec/sandbox2/tmp/tmp.NZeDUHLlVP/E---3.1_25874.p',divergence1) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.NZeDUHLlVP/E---3.1_25874.p',additive_idempotence) ).
fof(c_0_5,negated_conjecture,
~ ! [X4] :
( ! [X5] :
( addition(domain(X5),forward_diamond(X4,domain(X5))) = forward_diamond(X4,domain(X5))
=> domain(X5) = zero )
=> divergence(X4) = zero ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_6,plain,
! [X42,X43] : forward_diamond(X42,X43) = domain(multiplication(X42,domain(X43))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_7,plain,
! [X33] : domain(X33) = antidomain(antidomain(X33)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_8,negated_conjecture,
! [X55] :
( ( addition(domain(X55),forward_diamond(esk1_0,domain(X55))) != forward_diamond(esk1_0,domain(X55))
| domain(X55) = zero )
& divergence(esk1_0) != zero ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X50] : forward_diamond(X50,divergence(X50)) = divergence(X50),
inference(variable_rename,[status(thm)],[divergence1]) ).
cnf(c_0_12,negated_conjecture,
( domain(X1) = zero
| addition(domain(X1),forward_diamond(esk1_0,domain(X1))) != forward_diamond(esk1_0,domain(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
forward_diamond(X1,divergence(X1)) = divergence(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( antidomain(antidomain(X1)) = zero
| addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
fof(c_0_17,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_18,negated_conjecture,
( divergence(X1) = zero
| addition(divergence(X1),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1)))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
divergence(esk1_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE129+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.38 % Computer : n015.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 2400
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Tue Oct 3 05:02:32 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.24/0.52 Running first-order model finding
% 0.24/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.NZeDUHLlVP/E---3.1_25874.p
% 0.24/0.54 # Version: 3.1pre001
% 0.24/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 # Starting sh5l with 300s (1) cores
% 0.24/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26054 completed with status 0
% 0.24/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 # No SInE strategy applied
% 0.24/0.54 # Search class: FHUSM-FFMF21-DFFFFFNN
% 0.24/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.24/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.24/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.54 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.24/0.54 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.54 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.24/0.54 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 26066 completed with status 0
% 0.24/0.54 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.24/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.54 # No SInE strategy applied
% 0.24/0.54 # Search class: FHUSM-FFMF21-DFFFFFNN
% 0.24/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.24/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.24/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.54 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.24/0.54 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.54 # Preprocessing time : 0.001 s
% 0.24/0.54 # Presaturation interreduction done
% 0.24/0.54
% 0.24/0.54 # Proof found!
% 0.24/0.54 # SZS status Theorem
% 0.24/0.54 # SZS output start CNFRefutation
% See solution above
% 0.24/0.54 # Parsed axioms : 29
% 0.24/0.54 # Removed by relevancy pruning/SinE : 0
% 0.24/0.54 # Initial clauses : 31
% 0.24/0.54 # Removed in clause preprocessing : 8
% 0.24/0.54 # Initial clauses in saturation : 23
% 0.24/0.54 # Processed clauses : 58
% 0.24/0.54 # ...of these trivial : 3
% 0.24/0.54 # ...subsumed : 0
% 0.24/0.54 # ...remaining for further processing : 55
% 0.24/0.54 # Other redundant clauses eliminated : 0
% 0.24/0.54 # Clauses deleted for lack of memory : 0
% 0.24/0.54 # Backward-subsumed : 1
% 0.24/0.54 # Backward-rewritten : 0
% 0.24/0.54 # Generated clauses : 71
% 0.24/0.54 # ...of the previous two non-redundant : 40
% 0.24/0.54 # ...aggressively subsumed : 0
% 0.24/0.54 # Contextual simplify-reflections : 0
% 0.24/0.54 # Paramodulations : 71
% 0.24/0.54 # Factorizations : 0
% 0.24/0.54 # NegExts : 0
% 0.24/0.54 # Equation resolutions : 0
% 0.24/0.54 # Total rewrite steps : 84
% 0.24/0.54 # Propositional unsat checks : 0
% 0.24/0.54 # Propositional check models : 0
% 0.24/0.54 # Propositional check unsatisfiable : 0
% 0.24/0.54 # Propositional clauses : 0
% 0.24/0.54 # Propositional clauses after purity: 0
% 0.24/0.54 # Propositional unsat core size : 0
% 0.24/0.54 # Propositional preprocessing time : 0.000
% 0.24/0.54 # Propositional encoding time : 0.000
% 0.24/0.54 # Propositional solver time : 0.000
% 0.24/0.54 # Success case prop preproc time : 0.000
% 0.24/0.54 # Success case prop encoding time : 0.000
% 0.24/0.54 # Success case prop solver time : 0.000
% 0.24/0.54 # Current number of processed clauses : 31
% 0.24/0.54 # Positive orientable unit clauses : 23
% 0.24/0.54 # Positive unorientable unit clauses: 1
% 0.24/0.54 # Negative unit clauses : 1
% 0.24/0.54 # Non-unit-clauses : 6
% 0.24/0.54 # Current number of unprocessed clauses: 28
% 0.24/0.54 # ...number of literals in the above : 32
% 0.24/0.54 # Current number of archived formulas : 0
% 0.24/0.54 # Current number of archived clauses : 32
% 0.24/0.54 # Clause-clause subsumption calls (NU) : 3
% 0.24/0.54 # Rec. Clause-clause subsumption calls : 3
% 0.24/0.54 # Non-unit clause-clause subsumptions : 1
% 0.24/0.54 # Unit Clause-clause subsumption calls : 1
% 0.24/0.54 # Rewrite failures with RHS unbound : 0
% 0.24/0.54 # BW rewrite match attempts : 22
% 0.24/0.54 # BW rewrite match successes : 12
% 0.24/0.54 # Condensation attempts : 0
% 0.24/0.54 # Condensation successes : 0
% 0.24/0.54 # Termbank termtop insertions : 2314
% 0.24/0.54
% 0.24/0.54 # -------------------------------------------------
% 0.24/0.54 # User time : 0.007 s
% 0.24/0.54 # System time : 0.003 s
% 0.24/0.54 # Total time : 0.010 s
% 0.24/0.54 # Maximum resident set size: 1836 pages
% 0.24/0.54
% 0.24/0.54 # -------------------------------------------------
% 0.24/0.54 # User time : 0.028 s
% 0.24/0.54 # System time : 0.011 s
% 0.24/0.54 # Total time : 0.040 s
% 0.24/0.54 # Maximum resident set size: 1700 pages
% 0.24/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------