TSTP Solution File: KRS156+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS156+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Mon May 20 23:17:45 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 169 ( 76 ~; 64 |; 23 &)
% ( 6 <=>; 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC116(iV5475)
& cC140(iV5475)
& cowlThing(iV5475)
& cC138(iV5475) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_129,axiom,
cowlThing(iV5475),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_129) ).
fof(axiom_127,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC140(X1)
& cC116(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_127) ).
fof(axiom_131,axiom,
cTEST(iV5475),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_131) ).
fof(axiom_49,axiom,
! [X1] :
( cC140(X1)
<=> ( cTOP(X1)
& cC138(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_49) ).
fof(c_0_7,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC116(iV5475)
& cC140(iV5475)
& cowlThing(iV5475)
& cC138(iV5475) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_8,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_9,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ) ),
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_7])])])])]) ).
fof(c_0_10,plain,
! [X14] :
( cowlThing(X14)
& ~ cowlNothing(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_11,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_12,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
cowlThing(iV5475),
inference(split_conjunct,[status(thm)],[axiom_129]) ).
cnf(c_0_14,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X13] :
( ( ~ xsd_string(X13)
| ~ xsd_integer(X13) )
& ( xsd_integer(X13)
| xsd_string(X13) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_16,plain,
! [X11] :
( ( cC140(X11)
| ~ cTEST(X11) )
& ( cC116(X11)
| ~ cTEST(X11) )
& ( ~ cC140(X11)
| ~ cC116(X11)
| cTEST(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_127])])])]) ).
cnf(c_0_17,negated_conjecture,
( xsd_string(esk2_0)
| ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ cC116(iV5475)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( cC116(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
cTEST(iV5475),
inference(split_conjunct,[status(thm)],[axiom_131]) ).
cnf(c_0_22,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ cC116(iV5475)
| ~ xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_19]) ).
cnf(c_0_24,plain,
cC116(iV5475),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X10] :
( ( cTOP(X10)
| ~ cC140(X10) )
& ( cC138(X10)
| ~ cC140(X10) )
& ( ~ cTOP(X10)
| ~ cC138(X10)
| cC140(X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_49])])])]) ).
cnf(c_0_26,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ cC116(iV5475)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_13])]),c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ xsd_integer(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,plain,
( cC138(X1)
| ~ cC140(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( cC140(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
( ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ cC116(iV5475)
| ~ xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_18])]),c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( xsd_string(esk2_0)
| ~ cC140(iV5475) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
cC140(iV5475),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( ~ cC140(iV5475)
| ~ cC138(iV5475)
| ~ xsd_string(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_24])]) ).
cnf(c_0_35,negated_conjecture,
xsd_string(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
~ cC138(iV5475),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_33])]),c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KRS156+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n032.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 22:10:37 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.20/0.53 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.53 # Starting new_bool_1 with 600s (2) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_3 with pid 10520 completed with status 0
% 0.20/0.53 # Result found by new_bool_3
% 0.20/0.53 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.20/0.53 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHNF-FFSM11-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.20/0.53 # SAT001_MinMin_p005000_rr_RG with pid 10523 completed with status 0
% 0.20/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.53 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.20/0.53 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHNF-FFSM11-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 146
% 0.20/0.53 # Removed by relevancy pruning/SinE : 128
% 0.20/0.53 # Initial clauses : 35
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 35
% 0.20/0.53 # Processed clauses : 60
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 0
% 0.20/0.53 # ...remaining for further processing : 60
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 8
% 0.20/0.53 # Generated clauses : 7
% 0.20/0.53 # ...of the previous two non-redundant : 10
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 3
% 0.20/0.53 # Paramodulations : 7
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 14
% 0.20/0.53 # ...of those cached : 7
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 18
% 0.20/0.53 # Positive orientable unit clauses : 8
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 2
% 0.20/0.53 # Non-unit-clauses : 8
% 0.20/0.53 # Current number of unprocessed clauses: 17
% 0.20/0.53 # ...number of literals in the above : 40
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 42
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 129
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 88
% 0.20/0.53 # Non-unit clause-clause subsumptions : 3
% 0.20/0.53 # Unit Clause-clause subsumption calls : 2
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 5
% 0.20/0.53 # BW rewrite match successes : 5
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 2985
% 0.20/0.53 # Search garbage collected termcells : 1166
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.005 s
% 0.20/0.53 # System time : 0.006 s
% 0.20/0.53 # Total time : 0.011 s
% 0.20/0.53 # Maximum resident set size: 2164 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.010 s
% 0.20/0.53 # System time : 0.015 s
% 0.20/0.53 # Total time : 0.025 s
% 0.20/0.53 # Maximum resident set size: 1836 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------