TSTP Solution File: KRS166+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 130 ( 0 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 150 ( 56 ~; 75 |; 12 &)
% ( 5 <=>; 2 =>; 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 4 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cCar(X1)
<=> cAutomobile(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_2,axiom,
! [X1] :
( cAutomobile(X1)
=> cCar(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).
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_3,axiom,
! [X1] :
( cCar(X1)
=> cAutomobile(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cCar(X1)
<=> cAutomobile(X1) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_6,negated_conjecture,
( ( ~ cCar(esk4_0)
| ~ cAutomobile(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( cCar(esk4_0)
| cAutomobile(esk4_0)
| ~ xsd_string(esk3_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( ~ cCar(esk4_0)
| ~ cAutomobile(esk4_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk2_0) )
& ( cCar(esk4_0)
| cAutomobile(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,
! [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_8,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| cAutomobile(esk4_0)
| cCar(esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_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,
! [X2] :
( ~ cAutomobile(X2)
| cCar(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).
cnf(c_0_11,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| cAutomobile(esk4_0)
| cCar(esk4_0)
| ~ xsd_integer(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,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_14,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| cAutomobile(esk4_0)
| cCar(esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( cCar(esk4_0)
| xsd_string(esk3_0)
| cowlNothing(esk2_0)
| ~ xsd_integer(esk3_0) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| cAutomobile(esk4_0)
| cCar(esk4_0)
| ~ xsd_string(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9])]) ).
cnf(c_0_19,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( cCar(esk4_0)
| xsd_string(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk3_0)
| ~ cAutomobile(esk4_0)
| ~ cCar(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( cCar(esk4_0)
| xsd_integer(esk3_0)
| cowlNothing(esk2_0)
| ~ xsd_string(esk3_0) ),
inference(csr,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( cCar(esk4_0)
| ~ xsd_integer(esk3_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X2] :
( ~ cCar(X2)
| cAutomobile(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
cnf(c_0_25,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk3_0)
| ~ cAutomobile(esk4_0)
| ~ cCar(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ xsd_integer(esk3_0)
| ~ cAutomobile(esk4_0)
| ~ cCar(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_9])]) ).
cnf(c_0_27,negated_conjecture,
cCar(esk4_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_22]),c_0_17]),c_0_23]) ).
cnf(c_0_28,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ xsd_string(esk3_0)
| ~ cAutomobile(esk4_0)
| ~ cCar(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_9])]) ).
cnf(c_0_30,negated_conjecture,
( xsd_string(esk3_0)
| ~ cAutomobile(esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),c_0_15]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
( cAutomobile(esk4_0)
| ~ xsd_integer(esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( xsd_integer(esk3_0)
| ~ cAutomobile(esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_29,c_0_15]),c_0_12]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
cAutomobile(esk4_0),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
~ xsd_integer(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 18:44:47 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.014 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 : 36
% 0.22/1.40 # Proof object clause steps : 25
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 22
% 0.22/1.40 # Proof object clause conjectures : 19
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 10
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 6
% 0.22/1.40 # Proof object simplifying inferences : 24
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 5
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 10
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 9
% 0.22/1.40 # Processed clauses : 16
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 16
% 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 : 3
% 0.22/1.40 # Backward-rewritten : 5
% 0.22/1.40 # Generated clauses : 10
% 0.22/1.40 # ...of the previous two non-trivial : 9
% 0.22/1.40 # Contextual simplify-reflections : 9
% 0.22/1.40 # Paramodulations : 10
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 8
% 0.22/1.40 # Positive orientable unit clauses : 2
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 4
% 0.22/1.40 # Current number of unprocessed clauses: 1
% 0.22/1.40 # ...number of literals in the above : 1
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 9
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 10
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 10
% 0.22/1.40 # Non-unit clause-clause subsumptions : 10
% 0.22/1.40 # Unit Clause-clause subsumption calls : 4
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 643
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.011 s
% 0.22/1.40 # System time : 0.004 s
% 0.22/1.40 # Total time : 0.015 s
% 0.22/1.40 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------