TSTP Solution File: KRS129+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS129+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:40 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 98 ( 41 ~; 38 |; 14 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 31 ( 8 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& cEuroMP(iKinnock) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).
fof(axiom_3,axiom,
! [X4] :
( cEuroMP(X4)
<=> ? [X5] :
( risEuroMPFrom(X4,X5)
& cowlThing(X5) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(axiom_5,axiom,
! [X4,X5] :
( risEuroMPFrom(X4,X5)
<=> rhasEuroMP(X5,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_5) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).
fof(axiom_13,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_13) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& cEuroMP(iKinnock) ),
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)
| ~ cEuroMP(iKinnock) )
& ( xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0)
| ~ cEuroMP(iKinnock) ) ),
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,
! [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])])])]) ).
fof(c_0_9,plain,
! [X6,X6,X8] :
( ( risEuroMPFrom(X6,esk4_1(X6))
| ~ cEuroMP(X6) )
& ( cowlThing(esk4_1(X6))
| ~ cEuroMP(X6) )
& ( ~ risEuroMPFrom(X6,X8)
| ~ cowlThing(X8)
| cEuroMP(X6) ) ),
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_10,plain,
! [X6,X7,X6,X7] :
( ( ~ risEuroMPFrom(X6,X7)
| rhasEuroMP(X7,X6) )
& ( ~ rhasEuroMP(X7,X6)
| risEuroMPFrom(X6,X7) ) ),
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_11,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,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])])])])]) ).
cnf(c_0_14,plain,
( cEuroMP(X1)
| ~ cowlThing(X2)
| ~ risEuroMPFrom(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( risEuroMPFrom(X1,X2)
| ~ rhasEuroMP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[axiom_13]) ).
cnf(c_0_17,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_20,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12])]) ).
cnf(c_0_22,plain,
risEuroMPFrom(iKinnock,iUK),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
( xsd_string(esk3_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
xsd_string(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
xsd_integer(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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 15:51:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 31
% 0.24/1.42 # Proof object clause steps : 19
% 0.24/1.42 # Proof object formula steps : 12
% 0.24/1.42 # Proof object conjectures : 12
% 0.24/1.42 # Proof object clause conjectures : 9
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 9
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 5
% 0.24/1.42 # Proof object simplifying inferences : 14
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 27
% 0.24/1.42 # Removed by relevancy pruning/SinE : 10
% 0.24/1.42 # Initial clauses : 23
% 0.24/1.42 # Removed in clause preprocessing : 12
% 0.24/1.42 # Initial clauses in saturation : 11
% 0.24/1.42 # Processed clauses : 17
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 17
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 2
% 0.24/1.42 # Backward-rewritten : 2
% 0.24/1.42 # Generated clauses : 8
% 0.24/1.42 # ...of the previous two non-trivial : 6
% 0.24/1.42 # Contextual simplify-reflections : 2
% 0.24/1.42 # Paramodulations : 8
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 13
% 0.24/1.42 # Positive orientable unit clauses : 6
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 6
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 5
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 5
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 5
% 0.24/1.42 # Non-unit clause-clause subsumptions : 4
% 0.24/1.42 # Unit Clause-clause subsumption calls : 4
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1312
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.014 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.017 s
% 0.24/1.42 # Maximum resident set size: 2724 pages
%------------------------------------------------------------------------------