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