TSTP Solution File: KRS167+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS167+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:00 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 5 unt; 0 def)
% Number of atoms : 225 ( 18 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 271 ( 102 ~; 136 |; 24 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-1 aty)
% Number of variables : 70 ( 12 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( cc1(X4)
<=> cc2(X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_3,axiom,
! [X4] :
( cc2(X4)
<=> ( ? [X5] : rp(X4,X5)
& ! [X5,X6] :
( ( rp(X4,X5)
& rp(X4,X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(axiom_2,axiom,
! [X4] :
( cc1(X4)
<=> ( ? [X5] : rp(X4,X5)
& ! [X5,X6] :
( ( rp(X4,X5)
& rp(X4,X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( cc1(X4)
<=> cc2(X4) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_6,negated_conjecture,
( ( ~ cc1(esk4_0)
| ~ cc2(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( cc1(esk4_0)
| cc2(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( ~ cc1(esk4_0)
| ~ cc2(esk4_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( cc1(esk4_0)
| cc2(esk4_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_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_5])])])])])])]) ).
fof(c_0_7,plain,
! [X5,X5] :
( cowlThing(X5)
& ~ cowlNothing(X5) ),
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_8,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0)
| ~ cc2(esk4_0)
| ~ cc1(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X5,X5] :
( ( ~ xsd_string(X5)
| ~ xsd_integer(X5) )
& ( xsd_integer(X5)
| xsd_string(X5) ) ),
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_11,plain,
! [X7,X9,X10,X7,X11] :
( ( rp(X7,esk5_1(X7))
| ~ cc2(X7) )
& ( ~ rp(X7,X9)
| ~ rp(X7,X10)
| X9 = X10
| ~ cc2(X7) )
& ( rp(X7,esk6_1(X7))
| ~ rp(X7,X11)
| cc2(X7) )
& ( rp(X7,esk7_1(X7))
| ~ rp(X7,X11)
| cc2(X7) )
& ( esk6_1(X7) != esk7_1(X7)
| ~ rp(X7,X11)
| cc2(X7) ) ),
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_3])])])])])])]) ).
fof(c_0_12,plain,
! [X7,X9,X10,X7,X11] :
( ( rp(X7,esk8_1(X7))
| ~ cc1(X7) )
& ( ~ rp(X7,X9)
| ~ rp(X7,X10)
| X9 = X10
| ~ cc1(X7) )
& ( rp(X7,esk9_1(X7))
| ~ rp(X7,X11)
| cc1(X7) )
& ( rp(X7,esk10_1(X7))
| ~ rp(X7,X11)
| cc1(X7) )
& ( esk9_1(X7) != esk10_1(X7)
| ~ rp(X7,X11)
| cc1(X7) ) ),
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_13,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| cc2(esk4_0)
| cc1(esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0)
| ~ cc2(esk4_0)
| ~ cc1(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cc1(esk4_0)
| ~ cc2(esk4_0)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_16,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( X2 = X3
| ~ cc2(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( rp(X1,esk5_1(X1))
| ~ cc2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( cc1(X1)
| rp(X1,esk10_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( cc1(X1)
| rp(X1,esk9_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| cc2(esk4_0)
| cc1(esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( cc1(esk4_0)
| cc2(esk4_0)
| cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9])]) ).
cnf(c_0_24,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cc1(esk4_0)
| ~ cc2(esk4_0)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9])]) ).
cnf(c_0_25,negated_conjecture,
( xsd_string(esk3_0)
| ~ cc2(esk4_0)
| ~ cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_26,plain,
( X1 = esk5_1(X2)
| ~ rp(X2,X1)
| ~ cc2(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( rp(X1,esk10_1(X1))
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,plain,
( rp(X1,esk9_1(X1))
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_29,plain,
( cc1(X1)
| ~ rp(X1,X2)
| esk9_1(X1) != esk10_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( X2 = X3
| ~ cc1(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,plain,
( rp(X1,esk8_1(X1))
| ~ cc1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,plain,
( cc2(X1)
| rp(X1,esk6_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( cc2(X1)
| rp(X1,esk7_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
( cc1(esk4_0)
| cc2(esk4_0)
| cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_9])]) ).
cnf(c_0_35,negated_conjecture,
( xsd_string(esk3_0)
| cc2(esk4_0)
| cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_17]) ).
cnf(c_0_36,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
( xsd_integer(esk3_0)
| ~ cc2(esk4_0)
| ~ cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_24]),c_0_25]) ).
cnf(c_0_38,plain,
( esk5_1(X1) = esk10_1(X1)
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_39,plain,
( esk5_1(X1) = esk9_1(X1)
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_40,plain,
( cc1(X1)
| esk10_1(X1) != esk9_1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_41,plain,
( X1 = esk8_1(X2)
| ~ rp(X2,X1)
| ~ cc1(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_42,plain,
( rp(X1,esk6_1(X1))
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_43,plain,
( rp(X1,esk7_1(X1))
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_44,plain,
( cc2(X1)
| ~ rp(X1,X2)
| esk6_1(X1) != esk7_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,negated_conjecture,
( xsd_integer(esk3_0)
| cc2(esk4_0)
| cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( ~ cc2(esk4_0)
| ~ cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25]) ).
cnf(c_0_47,plain,
( cc1(X1)
| ~ cc2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( esk8_1(X1) = esk6_1(X1)
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( esk8_1(X1) = esk7_1(X1)
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_50,plain,
( cc2(X1)
| esk7_1(X1) != esk6_1(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_51,negated_conjecture,
( cc2(esk4_0)
| cc1(esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_35]) ).
cnf(c_0_52,negated_conjecture,
~ cc2(esk4_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( cc2(X1)
| ~ cc1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
cc1(esk4_0),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS167+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 07:28:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 56
% 0.22/1.40 # Proof object clause steps : 45
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 20
% 0.22/1.40 # Proof object clause conjectures : 17
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 18
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 21
% 0.22/1.40 # Proof object simplifying inferences : 19
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 13
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 26
% 0.22/1.40 # Removed in clause preprocessing : 9
% 0.22/1.40 # Initial clauses in saturation : 17
% 0.22/1.40 # Processed clauses : 49
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 9
% 0.22/1.40 # ...remaining for further processing : 40
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 18
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 81
% 0.22/1.40 # ...of the previous two non-trivial : 48
% 0.22/1.40 # Contextual simplify-reflections : 10
% 0.22/1.40 # Paramodulations : 80
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 20
% 0.22/1.40 # Positive orientable unit clauses : 1
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 17
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 21
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 131
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 124
% 0.22/1.40 # Non-unit clause-clause subsumptions : 36
% 0.22/1.40 # Unit Clause-clause subsumption calls : 5
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 1
% 0.22/1.40 # BW rewrite match successes : 1
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2495
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.017 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.019 s
% 0.22/1.40 # Maximum resident set size: 2708 pages
%------------------------------------------------------------------------------