%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 02:59:59 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 83 ( 11 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 96 ( 40 ~; 38 |; 15 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 17 ( 4 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).
fof(axiom_0,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_6,axiom,
! [X3] :
~ ( cB(X3)
& cA(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_6) ).
fof(axiom_4,axiom,
cB(ib),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_4) ).
fof(axiom_2,axiom,
cA(ia),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_7,negated_conjecture,
( ( ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib )
& ( xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ) ),
inference(distribute,[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)],[c_0_6])])])])])])]) ).
fof(c_0_8,plain,
! [X4,X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_0])])])]) ).
cnf(c_0_9,negated_conjecture,
( ia = ib
| cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X4] :
( ( ~ xsd_string(X4)
| ~ xsd_integer(X4) )
& ( xsd_integer(X4)
| xsd_string(X4) ) ),
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)],[axiom_1])])])])]) ).
cnf(c_0_12,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ib = ia
| cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_14,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ia = ib
| cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ia = ib
| xsd_string(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
fof(c_0_18,plain,
! [X4] :
( ~ cB(X4)
| ~ cA(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
cnf(c_0_19,negated_conjecture,
( ib = ia
| cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
( ia = ib
| ~ xsd_integer(esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ cA(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
cB(ib),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_23,plain,
cA(ia),
inference(split_conjunct,[status(thm)],[axiom_2]) ).
cnf(c_0_24,negated_conjecture,
ia = ib,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_14]),c_0_20]) ).
cnf(c_0_25,plain,
~ cA(ib),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 15:52:02 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.014 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 27
% 0.20/1.39 # Proof object clause steps : 16
% 0.20/1.39 # Proof object formula steps : 11
% 0.20/1.39 # Proof object conjectures : 10
% 0.20/1.39 # Proof object clause conjectures : 7
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 9
% 0.20/1.39 # Proof object initial formulas used : 6
% 0.20/1.39 # Proof object generating inferences : 4
% 0.20/1.39 # Proof object simplifying inferences : 13
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 14
% 0.20/1.39 # Removed by relevancy pruning/SinE : 0
% 0.20/1.39 # Initial clauses : 17
% 0.20/1.39 # Removed in clause preprocessing : 9
% 0.20/1.39 # Initial clauses in saturation : 8
% 0.20/1.39 # Processed clauses : 12
% 0.20/1.39 # ...of these trivial : 0
% 0.20/1.39 # ...subsumed : 0
% 0.20/1.39 # ...remaining for further processing : 12
% 0.20/1.39 # Other redundant clauses eliminated : 0
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 1
% 0.20/1.39 # Backward-rewritten : 4
% 0.20/1.39 # Generated clauses : 5
% 0.20/1.39 # ...of the previous two non-trivial : 4
% 0.20/1.39 # Contextual simplify-reflections : 3
% 0.20/1.39 # Paramodulations : 5
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 0
% 0.20/1.39 # Current number of processed clauses : 7
% 0.20/1.39 # Positive orientable unit clauses : 2
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 2
% 0.20/1.39 # Non-unit-clauses : 3
% 0.20/1.39 # Current number of unprocessed clauses: 0
% 0.20/1.39 # ...number of literals in the above : 0
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 6
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 4
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 4
% 0.20/1.39 # Non-unit clause-clause subsumptions : 4
% 0.20/1.39 # Unit Clause-clause subsumption calls : 1
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 1
% 0.20/1.39 # BW rewrite match successes : 1
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 855
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.013 s
% 0.20/1.39 # System time : 0.002 s
% 0.20/1.39 # Total time : 0.015 s
% 0.20/1.39 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------