%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS164+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 117 ( 50 ~; 46 |; 17 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 19 ( 5 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cAutomobile(icar)
& cowlThing(icar) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).
fof(axiom_2,axiom,
! [X1] :
( cCar(X1)
<=> cAutomobile(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(axiom_3,axiom,
cAutomobile(iauto),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_5,axiom,
cCar(icar),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_5) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cAutomobile(icar)
& cowlThing(icar) ),
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)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cAutomobile(icar)
| ~ cowlThing(icar) )
& ( xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cAutomobile(icar)
| ~ cowlThing(icar) ) ),
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,
! [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_9,plain,
! [X2,X2] :
( ( ~ cCar(X2)
| cAutomobile(X2) )
& ( ~ cAutomobile(X2)
| cCar(X2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
cnf(c_0_10,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(icar)
| ~ cAutomobile(icar)
| ~ cowlThing(iauto)
| ~ cCar(iauto)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
cAutomobile(iauto),
inference(split_conjunct,[status(thm)],[axiom_3]) ).
fof(c_0_14,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_15,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(icar)
| ~ cAutomobile(icar)
| ~ cowlThing(iauto)
| ~ cCar(iauto)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ xsd_string(esk3_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_17,plain,
cCar(iauto),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_21,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( xsd_integer(esk3_0)
| ~ cAutomobile(icar) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( xsd_string(esk3_0)
| ~ cAutomobile(icar) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17])]),c_0_18]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ cAutomobile(icar),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,plain,
cCar(icar),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS164+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 14:20:15 EDT 2022
% 0.12/0.33 % 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 : 28
% 0.20/1.39 # Proof object clause steps : 17
% 0.20/1.39 # Proof object formula steps : 11
% 0.20/1.39 # Proof object conjectures : 11
% 0.20/1.39 # Proof object clause conjectures : 8
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 10
% 0.20/1.39 # Proof object initial formulas used : 6
% 0.20/1.39 # Proof object generating inferences : 3
% 0.20/1.39 # Proof object simplifying inferences : 19
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 8
% 0.20/1.39 # Removed by relevancy pruning/SinE : 0
% 0.20/1.39 # Initial clauses : 12
% 0.20/1.39 # Removed in clause preprocessing : 3
% 0.20/1.39 # Initial clauses in saturation : 9
% 0.20/1.39 # Processed clauses : 13
% 0.20/1.39 # ...of these trivial : 0
% 0.20/1.39 # ...subsumed : 0
% 0.20/1.39 # ...remaining for further processing : 13
% 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 : 0
% 0.20/1.39 # Backward-rewritten : 2
% 0.20/1.39 # Generated clauses : 7
% 0.20/1.39 # ...of the previous two non-trivial : 6
% 0.20/1.39 # Contextual simplify-reflections : 3
% 0.20/1.39 # Paramodulations : 7
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 0
% 0.20/1.39 # Current number of processed clauses : 11
% 0.20/1.39 # Positive orientable unit clauses : 3
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 2
% 0.20/1.39 # Non-unit-clauses : 6
% 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 : 3
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 3
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 3
% 0.20/1.39 # Non-unit clause-clause subsumptions : 3
% 0.20/1.39 # Unit Clause-clause subsumption calls : 5
% 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 : 614
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.014 s
% 0.20/1.39 # System time : 0.001 s
% 0.20/1.39 # Total time : 0.015 s
% 0.20/1.39 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------