TSTP Solution File: KRS180+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS180+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:50 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 108 ( 40 ~; 39 |; 15 &)
% ( 8 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 11 sgn 56 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(isa_exclusive,conjecture,
! [X1,X2] :
? [X3,X4] :
( status(X3,X4,X1)
=> ~ ( isa(X1,X2)
& ( nota(X1,X2)
| nevera(X1,X2)
| xora(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_exclusive) ).
fof(isa,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(nota,axiom,
! [X1,X2] :
( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
<=> nota(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(nevera,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> ~ status(X3,X4,X2) )
<=> nevera(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(xora,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
<~> status(X3,X4,X2) )
<=> xora(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',xora) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
( status(X3,X4,X1)
=> ~ ( isa(X1,X2)
& ( nota(X1,X2)
| nevera(X1,X2)
| xora(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[isa_exclusive]) ).
fof(c_0_6,plain,
! [X41,X42,X45,X46,X47,X48] :
( ( status(esk9_2(X41,X42),esk10_2(X41,X42),X41)
| isa(X41,X42) )
& ( ~ status(esk9_2(X41,X42),esk10_2(X41,X42),X42)
| isa(X41,X42) )
& ( ~ isa(X45,X46)
| ~ status(X47,X48,X45)
| status(X47,X48,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[isa])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X13,X14] :
( status(X13,X14,esk1_0)
& isa(esk1_0,esk2_0)
& ( nota(esk1_0,esk2_0)
| nevera(esk1_0,esk2_0)
| xora(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
<=> nota(X1,X2) ),
inference(fof_simplification,[status(thm)],[nota]) ).
cnf(c_0_9,plain,
( status(X3,X4,X2)
| ~ isa(X1,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
status(X1,X2,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> ~ status(X3,X4,X2) )
<=> nevera(X1,X2) ),
inference(fof_simplification,[status(thm)],[nevera]) ).
fof(c_0_12,plain,
! [X33,X34,X35,X36,X37,X38] :
( ( ~ status(X35,X36,X33)
| status(X35,X36,X34)
| nota(X33,X34) )
& ( status(esk7_2(X37,X38),esk8_2(X37,X38),X37)
| ~ nota(X37,X38) )
& ( ~ status(esk7_2(X37,X38),esk8_2(X37,X38),X38)
| ~ nota(X37,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( status(X1,X2,X3)
| ~ isa(esk1_0,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
isa(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X1,X2] :
( ! [X3,X4] :
~ ( status(X3,X4,X1)
<=> status(X3,X4,X2) )
<=> xora(X1,X2) ),
inference(fof_simplification,[status(thm)],[xora]) ).
fof(c_0_16,plain,
! [X25,X26,X29,X30,X31,X32] :
( ( status(esk5_2(X25,X26),esk6_2(X25,X26),X25)
| nevera(X25,X26) )
& ( status(esk5_2(X25,X26),esk6_2(X25,X26),X26)
| nevera(X25,X26) )
& ( ~ nevera(X29,X30)
| ~ status(X31,X32,X29)
| ~ status(X31,X32,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_17,plain,
( ~ status(esk7_2(X1,X2),esk8_2(X1,X2),X2)
| ~ nota(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
status(X1,X2,esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X15,X16,X19,X20,X21,X22,X23,X24] :
( ( ~ status(esk3_2(X15,X16),esk4_2(X15,X16),X15)
| status(esk3_2(X15,X16),esk4_2(X15,X16),X16)
| xora(X15,X16) )
& ( ~ status(esk3_2(X15,X16),esk4_2(X15,X16),X16)
| status(esk3_2(X15,X16),esk4_2(X15,X16),X15)
| xora(X15,X16) )
& ( ~ status(X21,X22,X19)
| ~ status(X21,X22,X20)
| ~ xora(X19,X20) )
& ( status(X23,X24,X19)
| status(X23,X24,X20)
| ~ xora(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])])]) ).
cnf(c_0_20,plain,
( ~ nevera(X1,X2)
| ~ status(X3,X4,X1)
| ~ status(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( nota(esk1_0,esk2_0)
| nevera(esk1_0,esk2_0)
| xora(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
~ nota(X1,esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ status(X1,X2,X3)
| ~ status(X1,X2,X4)
| ~ xora(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ nevera(X1,esk2_0)
| ~ status(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( xora(esk1_0,esk2_0)
| nevera(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ xora(X1,esk2_0)
| ~ status(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
xora(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS180+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n015.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sat May 18 22:17:23 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.16/0.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 3900 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # SAT001_MinMin_p005000_rr_RG with pid 3903 completed with status 0
% 0.16/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 14
% 0.16/0.46 # Removed by relevancy pruning/SinE : 9
% 0.16/0.46 # Initial clauses : 16
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 16
% 0.16/0.46 # Processed clauses : 46
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 0
% 0.16/0.46 # ...remaining for further processing : 46
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 2
% 0.16/0.46 # Generated clauses : 32
% 0.16/0.46 # ...of the previous two non-redundant : 28
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 31
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 7
% 0.16/0.46 # ...of those cached : 3
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 27
% 0.16/0.46 # Positive orientable unit clauses : 6
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 2
% 0.16/0.46 # Non-unit-clauses : 19
% 0.16/0.46 # Current number of unprocessed clauses: 14
% 0.16/0.46 # ...number of literals in the above : 36
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 19
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 95
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 75
% 0.16/0.46 # Non-unit clause-clause subsumptions : 0
% 0.16/0.46 # Unit Clause-clause subsumption calls : 5
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 15
% 0.16/0.46 # BW rewrite match successes : 2
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 1789
% 0.16/0.46 # Search garbage collected termcells : 496
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.006 s
% 0.16/0.46 # System time : 0.003 s
% 0.16/0.46 # Total time : 0.009 s
% 0.16/0.46 # Maximum resident set size: 1724 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.007 s
% 0.16/0.46 # System time : 0.006 s
% 0.16/0.46 # Total time : 0.013 s
% 0.16/0.46 # Maximum resident set size: 1712 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------