%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS131+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 02:59:41 EDT 2022
% Result : Theorem 0.16s 1.35s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 6 unt; 0 def)
% Number of atoms : 167 ( 0 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 195 ( 75 ~; 93 |; 17 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 47 ( 9 sgn 26 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) ) ),
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_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_2,axiom,
! [X1] :
( cA(X1)
<=> ? [X2] :
( rq(X1,X2)
& cowlThing(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(axiom_5,axiom,
! [X1] :
( cnotA(X1)
<=> ! [X2] :
( rq(X1,X2)
=> cNothing(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_5) ).
fof(axiom_4,axiom,
! [X1] :
( cNothing(X1)
=> ? [X3] : rp(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_4) ).
fof(axiom_3,axiom,
! [X1] :
( cNothing(X1)
=> ~ ? [X2] : rp(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(c_0_7,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_8,negated_conjecture,
( ( ~ cnotA(esk7_0)
| cA(esk7_0)
| ~ xsd_string(esk6_0)
| xsd_integer(esk6_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk5_0) )
& ( cnotA(esk7_0)
| ~ cA(esk7_0)
| ~ xsd_string(esk6_0)
| xsd_integer(esk6_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk5_0) )
& ( ~ cnotA(esk7_0)
| cA(esk7_0)
| xsd_string(esk6_0)
| ~ xsd_integer(esk6_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk5_0) )
& ( cnotA(esk7_0)
| ~ cA(esk7_0)
| xsd_string(esk6_0)
| ~ xsd_integer(esk6_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk5_0) ) ),
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_7])])])])])])]) ).
fof(c_0_9,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])])])]) ).
cnf(c_0_10,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| cnotA(esk7_0)
| ~ cowlThing(esk4_0)
| ~ xsd_integer(esk6_0)
| ~ cA(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,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_13,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| cnotA(esk7_0)
| ~ cowlThing(esk4_0)
| ~ xsd_string(esk6_0)
| ~ cA(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X3,X3,X5] :
( ( rq(X3,esk1_1(X3))
| ~ cA(X3) )
& ( cowlThing(esk1_1(X3))
| ~ cA(X3) )
& ( ~ rq(X3,X5)
| ~ cowlThing(X5)
| cA(X3) ) ),
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)],[axiom_2])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| cnotA(esk7_0)
| ~ xsd_integer(esk6_0)
| ~ cA(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| cnotA(esk7_0)
| ~ xsd_string(esk6_0)
| ~ cA(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11])]) ).
cnf(c_0_19,plain,
( cA(X1)
| ~ cowlThing(X2)
| ~ rq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X3,X4,X3] :
( ( ~ cnotA(X3)
| ~ rq(X3,X4)
| cNothing(X4) )
& ( rq(X3,esk3_1(X3))
| cnotA(X3) )
& ( ~ cNothing(esk3_1(X3))
| cnotA(X3) ) ),
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)],[axiom_5])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| cA(esk7_0)
| ~ cowlThing(esk4_0)
| ~ xsd_integer(esk6_0)
| ~ cnotA(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( cnotA(esk7_0)
| xsd_string(esk6_0)
| ~ cA(esk7_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( cnotA(esk7_0)
| xsd_integer(esk6_0)
| ~ cA(esk7_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_25,plain,
( cA(X1)
| ~ rq(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11])]) ).
cnf(c_0_26,plain,
( cnotA(X1)
| rq(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| cA(esk7_0)
| ~ cowlThing(esk4_0)
| ~ xsd_string(esk6_0)
| ~ cnotA(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_28,plain,
! [X4] :
( ~ cNothing(X4)
| rp(X4,esk2_1(X4)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ cNothing(X3)
| ~ rp(X3,X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])]) ).
cnf(c_0_30,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| cA(esk7_0)
| ~ xsd_integer(esk6_0)
| ~ cnotA(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_11])]) ).
cnf(c_0_31,negated_conjecture,
( cnotA(esk7_0)
| ~ cA(esk7_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,plain,
( cnotA(X1)
| cA(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| cA(esk7_0)
| ~ xsd_string(esk6_0)
| ~ cnotA(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_11])]) ).
cnf(c_0_34,plain,
( rp(X1,esk2_1(X1))
| ~ cNothing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ rp(X1,X2)
| ~ cNothing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( cA(esk7_0)
| xsd_string(esk6_0)
| cowlNothing(esk5_0)
| ~ cnotA(esk7_0) ),
inference(csr,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_37,negated_conjecture,
cnotA(esk7_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( cA(esk7_0)
| xsd_integer(esk6_0)
| ~ cnotA(esk7_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_33,c_0_16]),c_0_17]) ).
cnf(c_0_39,plain,
( cNothing(X1)
| ~ rq(X2,X1)
| ~ cnotA(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_40,plain,
( rq(X1,esk1_1(X1))
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,plain,
~ cNothing(X1),
inference(csr,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( cA(esk7_0)
| xsd_string(esk6_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),c_0_16]) ).
cnf(c_0_43,negated_conjecture,
( cA(esk7_0)
| xsd_integer(esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_37])]) ).
cnf(c_0_44,plain,
( ~ cnotA(X1)
| ~ cA(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
cA(esk7_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_42]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.07 % Command : run_ET %s %d
% 0.06/0.27 % Computer : n029.cluster.edu
% 0.06/0.27 % Model : x86_64 x86_64
% 0.06/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.27 % Memory : 8042.1875MB
% 0.06/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.27 % CPULimit : 300
% 0.06/0.27 % WCLimit : 600
% 0.06/0.27 % DateTime : Tue Jun 7 12:43:05 EDT 2022
% 0.06/0.27 % 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.015 s
% 0.16/1.35
% 0.16/1.35 # Failure: Out of unprocessed clauses!
% 0.16/1.35 # OLD status GaveUp
% 0.16/1.35 # Parsed axioms : 7
% 0.16/1.35 # Removed by relevancy pruning/SinE : 2
% 0.16/1.35 # Initial clauses : 14
% 0.16/1.35 # Removed in clause preprocessing : 2
% 0.16/1.35 # Initial clauses in saturation : 12
% 0.16/1.35 # Processed clauses : 22
% 0.16/1.35 # ...of these trivial : 1
% 0.16/1.35 # ...subsumed : 0
% 0.16/1.35 # ...remaining for further processing : 21
% 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 : 5
% 0.16/1.35 # Backward-rewritten : 4
% 0.16/1.35 # Generated clauses : 12
% 0.16/1.35 # ...of the previous two non-trivial : 10
% 0.16/1.35 # Contextual simplify-reflections : 8
% 0.16/1.35 # Paramodulations : 12
% 0.16/1.35 # Factorizations : 0
% 0.16/1.35 # Equation resolutions : 0
% 0.16/1.35 # Current number of processed clauses : 12
% 0.16/1.35 # Positive orientable unit clauses : 2
% 0.16/1.35 # Positive unorientable unit clauses: 0
% 0.16/1.35 # Negative unit clauses : 1
% 0.16/1.35 # Non-unit-clauses : 9
% 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 : 10
% 0.16/1.35 # Clause-clause subsumption calls (NU) : 71
% 0.16/1.35 # Rec. Clause-clause subsumption calls : 49
% 0.16/1.35 # Non-unit clause-clause subsumptions : 12
% 0.16/1.35 # Unit Clause-clause subsumption calls : 5
% 0.16/1.35 # Rewrite failures with RHS unbound : 0
% 0.16/1.35 # BW rewrite match attempts : 2
% 0.16/1.35 # BW rewrite match successes : 2
% 0.16/1.35 # Condensation attempts : 0
% 0.16/1.35 # Condensation successes : 0
% 0.16/1.35 # Termbank termtop insertions : 949
% 0.16/1.35
% 0.16/1.35 # -------------------------------------------------
% 0.16/1.35 # User time : 0.011 s
% 0.16/1.35 # System time : 0.005 s
% 0.16/1.35 # Total time : 0.016 s
% 0.16/1.35 # Maximum resident set size: 2772 pages
% 0.16/1.35 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.16/1.35 # Preprocessing time : 0.015 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 : 47
% 0.16/1.35 # Proof object clause steps : 32
% 0.16/1.35 # Proof object formula steps : 15
% 0.16/1.35 # Proof object conjectures : 21
% 0.16/1.35 # Proof object clause conjectures : 18
% 0.16/1.35 # Proof object formula conjectures : 3
% 0.16/1.35 # Proof object initial clauses used : 14
% 0.16/1.35 # Proof object initial formulas used : 7
% 0.16/1.35 # Proof object generating inferences : 6
% 0.16/1.35 # Proof object simplifying inferences : 28
% 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 : 16
% 0.16/1.35 # Removed in clause preprocessing : 2
% 0.16/1.35 # Initial clauses in saturation : 14
% 0.16/1.35 # Processed clauses : 21
% 0.16/1.35 # ...of these trivial : 0
% 0.16/1.35 # ...subsumed : 0
% 0.16/1.35 # ...remaining for further processing : 21
% 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 : 3
% 0.16/1.35 # Backward-rewritten : 4
% 0.16/1.35 # Generated clauses : 13
% 0.16/1.35 # ...of the previous two non-trivial : 8
% 0.16/1.35 # Contextual simplify-reflections : 7
% 0.16/1.35 # Paramodulations : 13
% 0.16/1.35 # Factorizations : 0
% 0.16/1.35 # Equation resolutions : 0
% 0.16/1.35 # Current number of processed clauses : 14
% 0.16/1.35 # Positive orientable unit clauses : 2
% 0.16/1.35 # Positive unorientable unit clauses: 0
% 0.16/1.35 # Negative unit clauses : 2
% 0.16/1.35 # Non-unit-clauses : 10
% 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 : 8
% 0.16/1.35 # Clause-clause subsumption calls (NU) : 31
% 0.16/1.35 # Rec. Clause-clause subsumption calls : 21
% 0.16/1.35 # Non-unit clause-clause subsumptions : 9
% 0.16/1.35 # Unit Clause-clause subsumption calls : 3
% 0.16/1.35 # Rewrite failures with RHS unbound : 0
% 0.16/1.35 # BW rewrite match attempts : 2
% 0.16/1.35 # BW rewrite match successes : 2
% 0.16/1.35 # Condensation attempts : 0
% 0.16/1.35 # Condensation successes : 0
% 0.16/1.35 # Termbank termtop insertions : 1052
% 0.16/1.35
% 0.16/1.35 # -------------------------------------------------
% 0.16/1.35 # User time : 0.016 s
% 0.16/1.35 # System time : 0.000 s
% 0.16/1.35 # Total time : 0.016 s
% 0.16/1.35 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------