TSTP Solution File: KRS234+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS234+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 03:00:09 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 75 ( 30 ~; 31 |; 8 &)
% ( 3 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 15 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(uns,axiom,
! [X1,X2] :
( ( ! [X3] : model(X3,X1)
& ! [X4] : model(X4,not(X2)) )
<=> status(X1,X2,uns) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',uns) ).
fof(nevera,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(nevera_uns_thm,conjecture,
nevera(uns,thm),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nevera_uns_thm) ).
fof(c_0_5,plain,
! [X5,X6,X5,X6,X9,X10] :
( ( ~ model(esk4_2(X5,X6),X5)
| ~ model(esk5_2(X5,X6),not(X6))
| status(X5,X6,uns) )
& ( model(X9,X5)
| ~ status(X5,X6,uns) )
& ( model(X10,not(X6))
| ~ status(X5,X6,uns) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[uns])])])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X9,X10,X13,X14] :
( ( status(esk1_2(X9,X10),esk2_2(X9,X10),X9)
| nevera(X9,X10) )
& ( status(esk1_2(X9,X10),esk2_2(X9,X10),X10)
| nevera(X9,X10) )
& ( ~ nevera(X9,X10)
| ~ status(X13,X14,X9)
| ~ status(X13,X14,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[nevera])])])])])])])]) ).
fof(c_0_7,plain,
! [X11,X12,X11,X12] :
( ( ~ model(X11,X12)
| ~ model(X11,not(X12)) )
& ( model(X11,X12)
| model(X11,not(X12)) ) ),
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)],[completeness])])])])]) ).
cnf(c_0_8,plain,
( model(X3,not(X2))
| ~ status(X1,X2,uns) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X4,X5,X4,X5,X7] :
( ( model(esk3_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk3_2(X4,X5),X5)
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ~ model(X7,X4)
| model(X7,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[thm])])])])])])]) ).
cnf(c_0_11,plain,
( ~ status(X1,X2,X3)
| ~ status(X1,X2,X4)
| ~ nevera(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ model(X1,not(X2))
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( nevera(X1,uns)
| model(X2,not(esk2_2(X1,uns))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( model(X1,X2)
| ~ model(X1,X3)
| ~ status(X3,X2,thm) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( nevera(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( model(X3,X1)
| ~ status(X1,X2,uns) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_17,negated_conjecture,
~ nevera(uns,thm),
inference(assume_negation,[status(cth)],[nevera_uns_thm]) ).
cnf(c_0_18,plain,
( nevera(X1,X2)
| ~ nevera(X2,X3)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_19,plain,
( nevera(X1,uns)
| ~ model(X2,esk2_2(X1,uns)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( nevera(thm,X1)
| model(X2,esk2_2(thm,X1))
| ~ model(X2,esk1_2(thm,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( nevera(X1,uns)
| model(X2,esk1_2(X1,uns)) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
fof(c_0_22,negated_conjecture,
~ nevera(uns,thm),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( nevera(X1,X2)
| ~ nevera(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,plain,
nevera(thm,uns),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
~ nevera(uns,thm),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS234+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 16:02:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.017 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 27
% 0.25/1.43 # Proof object clause steps : 16
% 0.25/1.43 # Proof object formula steps : 11
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 8
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 8
% 0.25/1.43 # Proof object simplifying inferences : 2
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 33
% 0.25/1.43 # Removed by relevancy pruning/SinE : 21
% 0.25/1.43 # Initial clauses : 29
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 29
% 0.25/1.43 # Processed clauses : 97
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 28
% 0.25/1.43 # ...remaining for further processing : 69
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 2
% 0.25/1.43 # Generated clauses : 136
% 0.25/1.43 # ...of the previous two non-trivial : 118
% 0.25/1.43 # Contextual simplify-reflections : 1
% 0.25/1.43 # Paramodulations : 136
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 67
% 0.25/1.43 # Positive orientable unit clauses : 19
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 8
% 0.25/1.43 # Non-unit-clauses : 40
% 0.25/1.43 # Current number of unprocessed clauses: 37
% 0.25/1.43 # ...number of literals in the above : 89
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 2
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 76
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 72
% 0.25/1.43 # Non-unit clause-clause subsumptions : 4
% 0.25/1.43 # Unit Clause-clause subsumption calls : 27
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 12
% 0.25/1.43 # BW rewrite match successes : 2
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 3222
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.017 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.021 s
% 0.25/1.43 # Maximum resident set size: 3028 pages
%------------------------------------------------------------------------------