TSTP Solution File: KRS137+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS137+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:13:17 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 114 ( 50 ~; 41 |; 18 &)
% ( 5 <=>; 0 =>; 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 : 18 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cowlThing(icar)
& cAutomobile(icar) ),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',axiom_1) ).
fof(axiom_2,axiom,
! [X1] :
( cCar(X1)
<=> cAutomobile(X1) ),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',axiom_2) ).
fof(axiom_6,axiom,
cCar(icar),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',axiom_6) ).
fof(axiom_4,axiom,
cAutomobile(iauto),
file('/export/starexec/sandbox/tmp/tmp.tNsZiywvez/E---3.1_19696.p',axiom_4) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cowlThing(icar)
& cAutomobile(icar) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_7,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_8,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_9,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ) ),
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_6])])])])]) ).
fof(c_0_10,plain,
! [X5] :
( cowlThing(X5)
& ~ cowlNothing(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
fof(c_0_11,plain,
! [X6] :
( ( ~ xsd_string(X6)
| ~ xsd_integer(X6) )
& ( xsd_integer(X6)
| xsd_string(X6) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_12,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13])]),c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_13]),c_0_13])]),c_0_14]),c_0_17]) ).
fof(c_0_20,plain,
! [X4] :
( ( ~ cCar(X4)
| cAutomobile(X4) )
& ( ~ cAutomobile(X4)
| cCar(X4) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_22,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
cCar(icar),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_24,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
cAutomobile(iauto),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_26,negated_conjecture,
~ cCar(iauto),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS137+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n002.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:04:12 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 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/tmp/tmp.tNsZiywvez/E---3.1_19696.p
% 0.21/0.48 # Version: 3.1.0
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # sh5l with pid 19777 completed with status 0
% 0.21/0.48 # Result found by sh5l
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.48 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 19781 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.48 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 8
% 0.21/0.48 # Removed by relevancy pruning/SinE : 0
% 0.21/0.48 # Initial clauses : 12
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 12
% 0.21/0.48 # Processed clauses : 25
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 0
% 0.21/0.48 # ...remaining for further processing : 24
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 3
% 0.21/0.48 # Backward-rewritten : 2
% 0.21/0.48 # Generated clauses : 5
% 0.21/0.48 # ...of the previous two non-redundant : 3
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 3
% 0.21/0.48 # Paramodulations : 5
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 9
% 0.21/0.48 # ...of those cached : 5
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 9
% 0.21/0.48 # Positive orientable unit clauses : 3
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 2
% 0.21/0.48 # Non-unit-clauses : 4
% 0.21/0.48 # Current number of unprocessed clauses: 0
% 0.21/0.48 # ...number of literals in the above : 0
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 15
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 25
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 20
% 0.21/0.48 # Non-unit clause-clause subsumptions : 5
% 0.21/0.48 # Unit Clause-clause subsumption calls : 3
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 2
% 0.21/0.48 # BW rewrite match successes : 2
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 697
% 0.21/0.48 # Search garbage collected termcells : 138
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.003 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.005 s
% 0.21/0.48 # Maximum resident set size: 1760 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.005 s
% 0.21/0.48 # System time : 0.004 s
% 0.21/0.48 # Total time : 0.009 s
% 0.21/0.48 # Maximum resident set size: 1692 pages
% 0.21/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------