TSTP Solution File: KLE083+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE083+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:06 EDT 2023
% Result : Timeout 0.45s 300.22s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',left_distributivity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',domain1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',additive_identity) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',domain3) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',domain4) ).
fof(goals,conjecture,
! [X4] : X4 = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',goals) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p',multiplicative_left_identity) ).
fof(c_0_7,plain,
! [X15,X16,X17] : multiplication(addition(X15,X16),X17) = addition(multiplication(X15,X17),multiplication(X16,X17)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_8,plain,
! [X20] : multiplication(antidomain(X20),X20) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_9,plain,
! [X34] : addition(X34,zero) = X34,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_10,plain,
! [X27] : addition(antidomain(antidomain(X27)),antidomain(X27)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_11,plain,
! [X26] : domain(X26) = antidomain(antidomain(X26)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_12,negated_conjecture,
~ ! [X4] : X4 = multiplication(domain(X4),X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X11] : multiplication(one,X11) = X11,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_19,negated_conjecture,
esk1_0 != multiplication(domain(esk1_0),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_20,plain,
multiplication(addition(X1,antidomain(X2)),X2) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
addition(domain(X1),antidomain(X1)) = one,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 != multiplication(domain(esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : KLE083+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.17 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n002.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Tue Oct 3 05:09:14 EDT 2023
% 0.15/0.39 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4ZV2uRcYG6/E---3.1_9583.p
% 0.45/300.22 # Version: 3.1pre001
% 0.45/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.22 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.22 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.22 # Starting sh5l with 300s (1) cores
% 0.45/300.22 # sh5l with pid 9680 completed with status 0
% 0.45/300.22 # Result found by sh5l
% 0.45/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.22 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.22 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.22 # Starting sh5l with 300s (1) cores
% 0.45/300.22 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/300.22 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.45/300.22 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.45/300.22 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.45/300.22 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 9683 completed with status 0
% 0.45/300.22 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.45/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.22 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.22 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.22 # Starting sh5l with 300s (1) cores
% 0.45/300.22 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/300.22 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.45/300.22 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.45/300.22 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.45/300.22 # Preprocessing time : 0.001 s
% 0.45/300.22 # Presaturation interreduction done
% 0.45/300.22
% 0.45/300.22 # Proof found!
% 0.45/300.22 # SZS status Theorem
% 0.45/300.22 # SZS output start CNFRefutation
% See solution above
% 0.45/300.22 # Parsed axioms : 21
% 0.45/300.22 # Removed by relevancy pruning/SinE : 1
% 0.45/300.22 # Initial clauses : 20
% 0.45/300.22 # Removed in clause preprocessing : 0
% 0.45/300.22 # Initial clauses in saturation : 20
% 0.45/300.22 # Processed clauses : 116
% 0.45/300.22 # ...of these trivial : 28
% 0.45/300.22 # ...subsumed : 0
% 0.45/300.22 # ...remaining for further processing : 88
% 0.45/300.22 # Other redundant clauses eliminated : 0
% 0.45/300.22 # Clauses deleted for lack of memory : 0
% 0.45/300.22 # Backward-subsumed : 0
% 0.45/300.22 # Backward-rewritten : 8
% 0.45/300.22 # Generated clauses : 665
% 0.45/300.22 # ...of the previous two non-redundant : 324
% 0.45/300.22 # ...aggressively subsumed : 0
% 0.45/300.22 # Contextual simplify-reflections : 0
% 0.45/300.22 # Paramodulations : 665
% 0.45/300.22 # Factorizations : 0
% 0.45/300.22 # NegExts : 0
% 0.45/300.22 # Equation resolutions : 0
% 0.45/300.22 # Total rewrite steps : 836
% 0.45/300.22 # Propositional unsat checks : 0
% 0.45/300.22 # Propositional check models : 0
% 0.45/300.22 # Propositional check unsatisfiable : 0
% 0.45/300.22 # Propositional clauses : 0
% 0.45/300.22 # Propositional clauses after purity: 0
% 0.45/300.22 # Propositional unsat core size : 0
% 0.45/300.22 # Propositional preprocessing time : 0.000
% 0.45/300.22 # Propositional encoding time : 0.000
% 0.45/300.22 # Propositional solver time : 0.000
% 0.45/300.22 # Success case prop preproc time : 0.000
% 0.45/300.22 # Success case prop encoding time : 0.000
% 0.45/300.22 # Success case prop solver time : 0.000
% 0.45/300.22 # Current number of processed clauses : 60
% 0.45/300.22 # Positive orientable unit clauses : 59
% 0.45/300.22 # Positive unorientable unit clauses: 1
% 0.45/300.22 # Negative unit clauses : 0
% 0.45/300.22 # Non-unit-clauses : 0
% 0.45/300.22 # Current number of unprocessed clauses: 235
% 0.45/300.22 # ...number of literals in the above : 235
% 0.45/300.22 # Current number of archived formulas : 0
% 0.45/300.22 # Current number of archived clauses : 28
% 0.45/300.22 # Clause-clause subsumption calls (NU) : 0
% 0.45/300.22 # Rec. Clause-clause subsumption calls : 0
% 0.45/300.22 # Non-unit clause-clause subsumptions : 0
% 0.45/300.22 # Unit Clause-clause subsumption calls : 0
% 0.45/300.22 # Rewrite failures with RHS unbound : 0
% 0.45/300.22 # BW rewrite match attempts : 25
% 0.45/300.22 # BW rewrite match successes : 13
% 0.45/300.22 # Condensation attempts : 0
% 0.45/300.22 # Condensation successes : 0
% 0.45/300.22 # Termbank termtop insertions : 5625
% 0.45/300.22
% 0.45/300.22 # -------------------------------------------------
% 0.45/300.22 # User time : 0.010 s
% 0.45/300.22 # System time : 0.000 s
% 0.45/300.22 # Total time : 0.010 s
% 0.45/300.22 # Maximum resident set size: 1740 pages
% 0.45/300.22
% 0.45/300.22 # -------------------------------------------------
% 0.45/300.22 # User time : 0.012 s
% 0.45/300.22 # System time : 0.002 s
% 0.45/300.22 # Total time : 0.014 s
% 0.45/300.22 # Maximum resident set size: 1692 pages
% 0.45/300.22 % E---3.1 exiting
% 0.45/300.23 % E---3.1 exiting
%------------------------------------------------------------------------------