TSTP Solution File: KLE067+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE067+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:04 EDT 2023
% Result : Theorem 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/tmp/tmp.ZR0JMkZP89/E---3.1_25892.p',goals) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/tmp/tmp.ZR0JMkZP89/E---3.1_25892.p',domain5) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.ZR0JMkZP89/E---3.1_25892.p',domain2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZR0JMkZP89/E---3.1_25892.p',multiplicative_left_identity) ).
fof(c_0_4,negated_conjecture,
~ ! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X23,X24] : domain(addition(X23,X24)) = addition(domain(X23),domain(X24)),
inference(variable_rename,[status(thm)],[domain5]) ).
fof(c_0_7,plain,
! [X25,X26] : domain(multiplication(X25,X26)) = domain(multiplication(X25,domain(X26))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_8,plain,
! [X33] : multiplication(one,X33) = X33,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_9,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
domain(domain(addition(esk1_0,esk2_0))) != domain(addition(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : KLE067+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n005.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 04:50:31 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.ZR0JMkZP89/E---3.1_25892.p
% 0.23/0.53 # Version: 3.1pre001
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # sh5l with pid 25973 completed with status 0
% 0.23/0.53 # Result found by sh5l
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 25978 completed with status 0
% 0.23/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Theorem
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 18
% 0.23/0.53 # Removed by relevancy pruning/SinE : 1
% 0.23/0.53 # Initial clauses : 17
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 17
% 0.23/0.53 # Processed clauses : 34
% 0.23/0.53 # ...of these trivial : 1
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 33
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 3
% 0.23/0.53 # Generated clauses : 24
% 0.23/0.53 # ...of the previous two non-redundant : 10
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 24
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Total rewrite steps : 25
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 13
% 0.23/0.53 # Positive orientable unit clauses : 12
% 0.23/0.53 # Positive unorientable unit clauses: 1
% 0.23/0.53 # Negative unit clauses : 0
% 0.23/0.53 # Non-unit-clauses : 0
% 0.23/0.53 # Current number of unprocessed clauses: 10
% 0.23/0.53 # ...number of literals in the above : 10
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 20
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 0
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 21
% 0.23/0.53 # BW rewrite match successes : 18
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 858
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.002 s
% 0.23/0.53 # System time : 0.003 s
% 0.23/0.53 # Total time : 0.005 s
% 0.23/0.53 # Maximum resident set size: 1732 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.005 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.008 s
% 0.23/0.53 # Maximum resident set size: 1692 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------