%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 03:00:02 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 54 ( 20 ~; 20 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 4 sgn 24 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nota,axiom,
! [X1,X2] :
( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
<=> nota(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(nota_isa_nota,conjecture,
! [X1,X2,X11] :
( ( isa(X1,X2)
& nota(X1,X11) )
=> nota(X2,X11) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nota_isa_nota) ).
fof(isa,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(c_0_3,plain,
! [X5,X6,X7,X8,X5,X6] :
( ( ~ status(X7,X8,X5)
| status(X7,X8,X6)
| nota(X5,X6) )
& ( status(esk4_2(X5,X6),esk5_2(X5,X6),X5)
| ~ nota(X5,X6) )
& ( ~ status(esk4_2(X5,X6),esk5_2(X5,X6),X6)
| ~ nota(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[nota])])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X11] :
( ( isa(X1,X2)
& nota(X1,X11) )
=> nota(X2,X11) ),
inference(assume_negation,[status(cth)],[nota_isa_nota]) ).
cnf(c_0_5,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( status(esk4_2(X1,X2),esk5_2(X1,X2),X1)
| ~ nota(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
( isa(esk1_0,esk2_0)
& nota(esk1_0,esk3_0)
& ~ nota(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X5,X6,X5,X6,X9,X10] :
( ( status(esk6_2(X5,X6),esk7_2(X5,X6),X5)
| isa(X5,X6) )
& ( ~ status(esk6_2(X5,X6),esk7_2(X5,X6),X6)
| isa(X5,X6) )
& ( ~ isa(X5,X6)
| ~ status(X9,X10,X5)
| status(X9,X10,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isa])])])])])])]) ).
cnf(c_0_9,plain,
( nota(X1,X2)
| status(esk4_2(X1,X3),esk5_2(X1,X3),X2)
| ~ nota(X1,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
nota(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( status(X1,X2,X3)
| ~ status(X1,X2,X4)
| ~ isa(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( nota(esk1_0,X1)
| status(esk4_2(esk1_0,esk3_0),esk5_2(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ nota(X1,X2)
| ~ status(esk4_2(X1,X2),esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( nota(esk1_0,X1)
| status(esk4_2(esk1_0,esk3_0),esk5_2(esk1_0,esk3_0),X2)
| ~ isa(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
isa(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
~ nota(X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
status(esk4_2(esk1_0,esk3_0),esk5_2(esk1_0,esk3_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( nota(esk2_0,X1)
| status(esk4_2(esk1_0,esk3_0),esk5_2(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
~ nota(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_10])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS181+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 07:17:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.014 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 21
% 0.22/1.41 # Proof object clause steps : 14
% 0.22/1.41 # Proof object formula steps : 7
% 0.22/1.41 # Proof object conjectures : 11
% 0.22/1.41 # Proof object clause conjectures : 8
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 7
% 0.22/1.41 # Proof object initial formulas used : 3
% 0.22/1.41 # Proof object generating inferences : 7
% 0.22/1.41 # Proof object simplifying inferences : 4
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 14
% 0.22/1.41 # Removed by relevancy pruning/SinE : 11
% 0.22/1.41 # Initial clauses : 9
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 9
% 0.22/1.41 # Processed clauses : 27
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 3
% 0.22/1.41 # ...remaining for further processing : 24
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 38
% 0.22/1.41 # ...of the previous two non-trivial : 34
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 38
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 24
% 0.22/1.41 # Positive orientable unit clauses : 4
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 3
% 0.22/1.41 # Non-unit-clauses : 17
% 0.22/1.41 # Current number of unprocessed clauses: 16
% 0.22/1.41 # ...number of literals in the above : 48
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 44
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 39
% 0.22/1.41 # Non-unit clause-clause subsumptions : 3
% 0.22/1.41 # Unit Clause-clause subsumption calls : 12
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 5
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 1239
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.014 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.016 s
% 0.22/1.41 # Maximum resident set size: 2820 pages
%------------------------------------------------------------------------------