TSTP Solution File: KRS168+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS168+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 300s
% DateTime : Sat May 4 08:12:27 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 5 unt; 0 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 64 ( 5 avg)
% Number of connectives : 272 ( 105 ~; 140 |; 21 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ( ~ cB(X1)
& ~ cA(X1) )
<=> ~ ( cA(X1)
| cB(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ewSgSyZfjc/E---3.1_31971.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ewSgSyZfjc/E---3.1_31971.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ewSgSyZfjc/E---3.1_31971.p',axiom_1) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( ( ~ cB(X1)
& ~ cA(X1) )
<=> ~ ( cA(X1)
| cB(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_4,negated_conjecture,
( ( cB(esk3_0)
| cA(esk3_0)
| cA(esk3_0)
| cB(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cB(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cA(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cB(esk3_0)
| ~ cA(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cB(esk3_0)
| cA(esk3_0)
| cA(esk3_0)
| cB(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cB(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cB(esk3_0)
| ~ cB(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk3_0)
| ~ cA(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cB(esk3_0)
| ~ cA(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
cnf(c_0_6,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ cA(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X6] :
( cowlThing(X6)
& ~ cowlNothing(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_9,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X5] :
( ( ~ xsd_string(X5)
| ~ xsd_integer(X5) )
& ( xsd_integer(X5)
| xsd_string(X5) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,negated_conjecture,
( cB(esk3_0)
| cA(esk3_0)
| cA(esk3_0)
| cB(esk3_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cB(esk3_0) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ cA(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_17,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cB(esk3_0)
| cA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11])]) ).
cnf(c_0_21,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ cB(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( cA(esk3_0)
| cB(esk3_0)
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11])]),c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( xsd_string(esk2_0)
| ~ cB(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_17]),c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( cB(esk3_0)
| cA(esk3_0)
| cA(esk3_0)
| cB(esk3_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cB(esk3_0) ),
inference(cn,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cA(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_11])]) ).
cnf(c_0_29,negated_conjecture,
xsd_string(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cB(esk3_0)
| cA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ cB(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_11])]) ).
cnf(c_0_32,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
( cA(esk3_0)
| cB(esk3_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_11])]),c_0_17]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cB(esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29])]),c_0_17]) ).
cnf(c_0_35,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
xsd_integer(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS168+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 14:01:46 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ewSgSyZfjc/E---3.1_31971.p
% 0.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 32050 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 32053 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 3
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 14
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 14
% 0.21/0.49 # Processed clauses : 28
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 2
% 0.21/0.49 # ...remaining for further processing : 26
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 2
% 0.21/0.49 # Backward-rewritten : 6
% 0.21/0.49 # Generated clauses : 9
% 0.21/0.49 # ...of the previous two non-redundant : 3
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 8
% 0.21/0.49 # Paramodulations : 9
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 19
% 0.21/0.49 # ...of those cached : 16
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 6
% 0.21/0.49 # Positive orientable unit clauses : 3
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 2
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 20
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 18
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 18
% 0.21/0.49 # Non-unit clause-clause subsumptions : 12
% 0.21/0.49 # Unit Clause-clause subsumption calls : 8
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 2
% 0.21/0.49 # BW rewrite match successes : 2
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 963
% 0.21/0.49 # Search garbage collected termcells : 165
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1760 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.009 s
% 0.21/0.49 # Maximum resident set size: 1688 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------