%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 254 ( 58 equ)
% Maximal formula atoms : 50 ( 4 avg)
% Number of connectives : 328 ( 130 ~; 168 |; 22 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 36 ( 7 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ib
| X3 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).
fof(axiom_0,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_3,axiom,
! [X3] :
( cA_and_B(X3)
<=> ( cA(X3)
| cB(X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(axiom_2,axiom,
! [X3] :
( cA(X3)
<=> X3 = ia ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(axiom_4,axiom,
! [X3] :
( cB(X3)
<=> X3 = ib ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_4) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ib
| X3 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_7,negated_conjecture,
( ( esk4_0 != ib
| ~ cA_and_B(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk4_0 != ia
| ~ cA_and_B(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk4_0)
| esk4_0 = ib
| esk4_0 = ia
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk4_0 != ib
| ~ cA_and_B(esk4_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk4_0 != ia
| ~ cA_and_B(esk4_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk4_0)
| esk4_0 = ib
| esk4_0 = ia
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cowlThing(ia)
| ~ cowlThing(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,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0)
| ~ cA_and_B(esk4_0)
| esk4_0 != ia ),
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])])])])]) ).
fof(c_0_12,plain,
! [X4,X4] :
( ( ~ cA_and_B(X4)
| cA(X4)
| cB(X4) )
& ( ~ cA(X4)
| cA_and_B(X4) )
& ( ~ cB(X4)
| cA_and_B(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).
fof(c_0_13,plain,
! [X4,X4] :
( ( ~ cA(X4)
| X4 = ia )
& ( X4 != ia
| cA(X4) ) ),
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_14,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0)
| ~ cA_and_B(esk4_0)
| esk4_0 != ia ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| esk4_0 != ia
| ~ cA_and_B(esk4_0)
| ~ xsd_string(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_17,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( cA_and_B(X1)
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( cA(X1)
| X1 != ia ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| esk4_0 != ia
| ~ cA_and_B(esk4_0)
| ~ xsd_integer(esk3_0) ),
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_21,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0)
| ~ cA_and_B(esk4_0)
| esk4_0 != ib ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| esk4_0 = ia
| esk4_0 = ib
| cA_and_B(esk4_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
( xsd_integer(esk3_0)
| esk4_0 != ia
| ~ cA_and_B(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_25,plain,
( cA_and_B(X1)
| X1 != ia ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( xsd_string(esk3_0)
| esk4_0 != ia
| ~ xsd_integer(esk3_0)
| ~ cA_and_B(esk4_0) ),
inference(sr,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0)
| ~ cA_and_B(esk4_0)
| esk4_0 != ib ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| esk4_0 != ib
| ~ cA_and_B(esk4_0)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_29,negated_conjecture,
( esk4_0 = ia
| esk4_0 = ib
| cA_and_B(esk4_0)
| 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_22,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_30,negated_conjecture,
( esk4_0 != ia
| ~ xsd_string(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( xsd_string(esk3_0)
| esk4_0 != ia
| ~ cA_and_B(esk4_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| esk4_0 = ia
| esk4_0 = ib
| cA_and_B(esk4_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| esk4_0 != ib
| ~ cA_and_B(esk4_0)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_34,negated_conjecture,
( xsd_string(esk3_0)
| esk4_0 != ib
| ~ xsd_integer(esk3_0)
| ~ cA_and_B(esk4_0) ),
inference(sr,[status(thm)],[c_0_28,c_0_15]) ).
fof(c_0_35,plain,
! [X4,X4] :
( ( ~ cB(X4)
| X4 = ib )
& ( X4 != ib
| cB(X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
cnf(c_0_36,negated_conjecture,
( esk4_0 = ia
| esk4_0 = ib
| xsd_integer(esk3_0)
| cA_and_B(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_17]) ).
cnf(c_0_37,negated_conjecture,
esk4_0 != ia,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( esk4_0 = ia
| esk4_0 = ib
| cA_and_B(esk4_0)
| 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_32,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_39,negated_conjecture,
( xsd_integer(esk3_0)
| esk4_0 != ib
| ~ xsd_string(esk3_0)
| ~ cA_and_B(esk4_0) ),
inference(sr,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
( xsd_string(esk3_0)
| esk4_0 != ib
| ~ cA_and_B(esk4_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_41,plain,
( cA_and_B(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,plain,
( cB(X1)
| X1 != ib ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( X1 = ib
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( cB(X1)
| cA(X1)
| ~ cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( esk4_0 = ib
| xsd_integer(esk3_0)
| cA_and_B(esk4_0) ),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
( esk4_0 = ib
| xsd_string(esk3_0)
| cA_and_B(esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_38]),c_0_17]),c_0_25]) ).
cnf(c_0_47,negated_conjecture,
( esk4_0 != ib
| ~ cA_and_B(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( cA_and_B(X1)
| X1 != ib ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( X1 = ia
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,plain,
( X1 = ib
| cA(X1)
| ~ cA_and_B(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( esk4_0 = ib
| cA_and_B(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_45]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
esk4_0 != ib,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( X1 = ib
| X1 = ia
| ~ cA_and_B(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
cA_and_B(esk4_0),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_52]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS175+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 10:35:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 56
% 0.25/1.42 # Proof object clause steps : 43
% 0.25/1.42 # Proof object formula steps : 13
% 0.25/1.42 # Proof object conjectures : 31
% 0.25/1.42 # Proof object clause conjectures : 28
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 17
% 0.25/1.42 # Proof object initial formulas used : 6
% 0.25/1.42 # Proof object generating inferences : 15
% 0.25/1.42 # Proof object simplifying inferences : 39
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 15
% 0.25/1.42 # Removed by relevancy pruning/SinE : 0
% 0.25/1.42 # Initial clauses : 26
% 0.25/1.42 # Removed in clause preprocessing : 10
% 0.25/1.42 # Initial clauses in saturation : 16
% 0.25/1.42 # Processed clauses : 37
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 4
% 0.25/1.42 # ...remaining for further processing : 33
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 9
% 0.25/1.42 # Backward-rewritten : 3
% 0.25/1.42 # Generated clauses : 30
% 0.25/1.42 # ...of the previous two non-trivial : 22
% 0.25/1.42 # Contextual simplify-reflections : 10
% 0.25/1.42 # Paramodulations : 28
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 19
% 0.25/1.42 # Positive orientable unit clauses : 1
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 3
% 0.25/1.42 # Non-unit-clauses : 15
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 15
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 160
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 116
% 0.25/1.42 # Non-unit clause-clause subsumptions : 19
% 0.25/1.42 # Unit Clause-clause subsumption calls : 13
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 1574
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.016 s
% 0.25/1.42 # System time : 0.001 s
% 0.25/1.42 # Total time : 0.017 s
% 0.25/1.42 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------