%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS255+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Sun Jul 17 03:00:12 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 54 ( 20 ~; 18 |; 11 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 9 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(mighta,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) )
<=> mighta(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(sap,axiom,
! [X1,X2] :
( ( ? [X3] : model(X3,X1)
=> ? [X4] : model(X4,X2) )
<=> status(X1,X2,sap) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',sap) ).
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).
fof(mighta_sap_thm,conjecture,
mighta(sap,thm),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mighta_sap_thm) ).
fof(c_0_5,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])])])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X9,X10] :
( ( ~ status(X11,X12,X9)
| ~ status(X11,X12,X10)
| mighta(X9,X10) )
& ( status(esk1_2(X9,X10),esk2_2(X9,X10),X9)
| ~ mighta(X9,X10) )
& ( status(esk1_2(X9,X10),esk2_2(X9,X10),X10)
| ~ mighta(X9,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)],[mighta])])])])])])]) ).
cnf(c_0_7,plain,
( status(X1,X2,thm)
| ~ model(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( status(X1,X2,thm)
| model(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X5,X6,X8,X5,X6,X9] :
( ( model(esk4_2(X5,X6),X5)
| status(X5,X6,sap) )
& ( ~ model(X8,X6)
| status(X5,X6,sap) )
& ( ~ status(X5,X6,sap)
| ~ model(X9,X5)
| model(esk5_2(X5,X6),X6) ) ),
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)],[sap])])])])])])]) ).
fof(c_0_10,plain,
( model(esk21_0,esk22_0)
& ~ model(esk21_0,esk23_0)
& model(esk24_0,esk23_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[non_thm_spt])])])])]) ).
fof(c_0_11,negated_conjecture,
~ mighta(sap,thm),
inference(assume_negation,[status(cth)],[mighta_sap_thm]) ).
cnf(c_0_12,plain,
( mighta(X1,X2)
| ~ status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
status(X1,X1,thm),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,plain,
( status(X1,X2,sap)
| ~ model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
model(esk24_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ mighta(sap,thm),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( mighta(X1,thm)
| ~ status(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
status(X1,esk23_0,sap),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ mighta(sap,thm),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS255+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 06:58:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.016 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 21
% 0.23/1.40 # Proof object clause steps : 10
% 0.23/1.40 # Proof object formula steps : 11
% 0.23/1.40 # Proof object conjectures : 4
% 0.23/1.40 # Proof object clause conjectures : 1
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 6
% 0.23/1.40 # Proof object initial formulas used : 5
% 0.23/1.40 # Proof object generating inferences : 4
% 0.23/1.40 # Proof object simplifying inferences : 1
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 33
% 0.23/1.40 # Removed by relevancy pruning/SinE : 23
% 0.23/1.40 # Initial clauses : 25
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 25
% 0.23/1.40 # Processed clauses : 33
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 33
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 45
% 0.23/1.40 # ...of the previous two non-trivial : 38
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 45
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 33
% 0.23/1.40 # Positive orientable unit clauses : 14
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 7
% 0.23/1.40 # Non-unit-clauses : 12
% 0.23/1.40 # Current number of unprocessed clauses: 30
% 0.23/1.40 # ...number of literals in the above : 61
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 6
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 6
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 30
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 12
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1968
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.014 s
% 0.23/1.40 # System time : 0.004 s
% 0.23/1.40 # Total time : 0.018 s
% 0.23/1.40 # Maximum resident set size: 3028 pages
%------------------------------------------------------------------------------