TSTP Solution File: KRS148+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS148+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:56 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 148 ( 63 ~; 58 |; 22 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 23 ( 6 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC138(iV5475)
& cowlThing(iV5475)
& cC116(iV5475)
& cC140(iV5475) ),
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_25,axiom,
! [X1] :
( cC140(X1)
<=> ( cTOP(X1)
& cC138(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_25) ).
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_71,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC140(X1)
& cC116(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_71) ).
fof(axiom_72,axiom,
cTEST(iV5475),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_72) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC138(iV5475)
& cowlThing(iV5475)
& cC116(iV5475)
& cC140(iV5475) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_7,negated_conjecture,
( ( ~ xsd_string(esk41_0)
| xsd_integer(esk41_0)
| ~ cowlThing(esk39_0)
| cowlNothing(esk40_0)
| ~ cC138(iV5475)
| ~ cowlThing(iV5475)
| ~ cC116(iV5475)
| ~ cC140(iV5475) )
& ( xsd_string(esk41_0)
| ~ xsd_integer(esk41_0)
| ~ cowlThing(esk39_0)
| cowlNothing(esk40_0)
| ~ cC138(iV5475)
| ~ cowlThing(iV5475)
| ~ cC116(iV5475)
| ~ cC140(iV5475) ) ),
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,
! [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_9,negated_conjecture,
( cowlNothing(esk40_0)
| xsd_integer(esk41_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475)
| ~ cowlThing(esk39_0)
| ~ xsd_string(esk41_0) ),
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,
! [X2,X2] :
( ( cTOP(X2)
| ~ cC140(X2) )
& ( cC138(X2)
| ~ cC140(X2) )
& ( ~ cTOP(X2)
| ~ cC138(X2)
| cC140(X2) ) ),
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_25])])])])]) ).
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(esk40_0)
| xsd_string(esk41_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475)
| ~ cowlThing(esk39_0)
| ~ xsd_integer(esk41_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( cowlNothing(esk40_0)
| xsd_integer(esk41_0)
| ~ xsd_string(esk41_0)
| ~ cC116(iV5475)
| ~ cC138(iV5475)
| ~ cC140(iV5475) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10])]) ).
cnf(c_0_15,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( cC138(X1)
| ~ cC140(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
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(esk40_0)
| xsd_string(esk41_0)
| ~ xsd_integer(esk41_0)
| ~ cC116(iV5475)
| ~ cC138(iV5475)
| ~ cC140(iV5475) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_10])]) ).
fof(c_0_19,plain,
! [X2,X2] :
( ( cC140(X2)
| ~ cTEST(X2) )
& ( cC116(X2)
| ~ cTEST(X2) )
& ( ~ cC140(X2)
| ~ cC116(X2)
| cTEST(X2) ) ),
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_71])])])])]) ).
cnf(c_0_20,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( xsd_integer(esk41_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( xsd_string(esk41_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_23,plain,
( cC116(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
cTEST(iV5475),
inference(split_conjunct,[status(thm)],[axiom_72]) ).
cnf(c_0_25,negated_conjecture,
( ~ cC140(iV5475)
| ~ cC116(iV5475) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
cC116(iV5475),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( cC140(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
~ cC140(iV5475),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS148+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.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 05:34:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.016 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 90
% 0.21/1.40 # Removed by relevancy pruning/SinE : 77
% 0.21/1.40 # Initial clauses : 22
% 0.21/1.40 # Removed in clause preprocessing : 3
% 0.21/1.40 # Initial clauses in saturation : 19
% 0.21/1.40 # Processed clauses : 24
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 1
% 0.21/1.40 # ...remaining for further processing : 23
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 4
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 10
% 0.21/1.40 # ...of the previous two non-trivial : 5
% 0.21/1.40 # Contextual simplify-reflections : 5
% 0.21/1.40 # Paramodulations : 10
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 19
% 0.21/1.40 # Positive orientable unit clauses : 2
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 15
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 5
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 45
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 31
% 0.21/1.40 # Non-unit clause-clause subsumptions : 9
% 0.21/1.40 # Unit Clause-clause subsumption calls : 2
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 0
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 1869
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.015 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.017 s
% 0.21/1.40 # Maximum resident set size: 2944 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.023 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 30
% 0.21/1.40 # Proof object clause steps : 18
% 0.21/1.40 # Proof object formula steps : 12
% 0.21/1.40 # Proof object conjectures : 11
% 0.21/1.40 # Proof object clause conjectures : 8
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 10
% 0.21/1.40 # Proof object initial formulas used : 6
% 0.21/1.40 # Proof object generating inferences : 3
% 0.21/1.40 # Proof object simplifying inferences : 16
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 90
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 233
% 0.21/1.40 # Removed in clause preprocessing : 4
% 0.21/1.40 # Initial clauses in saturation : 229
% 0.21/1.40 # Processed clauses : 235
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 234
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 2
% 0.21/1.40 # Backward-rewritten : 1
% 0.21/1.40 # Generated clauses : 1570
% 0.21/1.40 # ...of the previous two non-trivial : 1491
% 0.21/1.40 # Contextual simplify-reflections : 5
% 0.21/1.40 # Paramodulations : 1570
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 231
% 0.21/1.40 # Positive orientable unit clauses : 5
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 9
% 0.21/1.40 # Non-unit-clauses : 217
% 0.21/1.40 # Current number of unprocessed clauses: 1485
% 0.21/1.40 # ...number of literals in the above : 4379
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 4
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 9243
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 8579
% 0.21/1.40 # Non-unit clause-clause subsumptions : 7
% 0.21/1.40 # Unit Clause-clause subsumption calls : 39
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 24405
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.037 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.041 s
% 0.21/1.40 # Maximum resident set size: 4900 pages
%------------------------------------------------------------------------------