TSTP Solution File: SWV408+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : Wed Jul 20 18:16:30 EDT 2022
% Result : Theorem 0.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 58 ( 23 ~; 21 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 39 ( 4 sgn 24 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l44_co,conjecture,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l44_co) ).
fof(l44_l45,lemma,
! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l44_l45) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
inference(assume_negation,[status(cth)],[l44_co]) ).
fof(c_0_5,negated_conjecture,
! [X10] :
( contains_slb(esk2_0,esk4_0)
& strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))
& ( ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X10)
| ~ less_than(findmin_pqp_res(esk1_0),X10) ) ),
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)],[c_0_4])])])])])]) ).
fof(c_0_6,lemma,
! [X5,X6,X7] :
( ( pair_in_list(update_slb(X5,X7),X6,esk5_3(X5,X6,X7))
| pair_in_list(update_slb(X5,X7),X6,X7)
| ~ contains_slb(X5,X6)
| ~ strictly_less_than(X6,X7) )
& ( less_than(X7,esk5_3(X5,X6,X7))
| pair_in_list(update_slb(X5,X7),X6,X7)
| ~ contains_slb(X5,X6)
| ~ strictly_less_than(X6,X7) ) ),
inference(distribute,[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)],[l44_l45])])])])])]) ).
fof(c_0_7,plain,
! [X5,X6,X7] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,lemma,
( pair_in_list(update_slb(X3,X2),X1,X2)
| pair_in_list(update_slb(X3,X2),X1,esk5_3(X3,X1,X2))
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0))
| ~ less_than(findmin_pqp_res(esk1_0),esk5_3(esk2_0,esk4_0,findmin_pqp_res(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
cnf(c_0_15,lemma,
( pair_in_list(update_slb(X3,X2),X1,X2)
| less_than(X2,esk5_3(X3,X1,X2))
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax20])]) ).
cnf(c_0_17,negated_conjecture,
( create_slb = esk2_0
| strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,lemma,
~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]),c_0_11]) ).
cnf(c_0_19,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
create_slb = esk2_0,
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
~ contains_slb(esk2_0,X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.16/0.36 % Computer : n004.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Wed Jun 15 23:10:39 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45 # Preprocessing time : 0.018 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 23
% 0.28/1.45 # Proof object clause steps : 14
% 0.28/1.45 # Proof object formula steps : 9
% 0.28/1.45 # Proof object conjectures : 11
% 0.28/1.45 # Proof object clause conjectures : 8
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 8
% 0.28/1.45 # Proof object initial formulas used : 4
% 0.28/1.45 # Proof object generating inferences : 3
% 0.28/1.45 # Proof object simplifying inferences : 9
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 43
% 0.28/1.45 # Removed by relevancy pruning/SinE : 19
% 0.28/1.45 # Initial clauses : 35
% 0.28/1.45 # Removed in clause preprocessing : 0
% 0.28/1.45 # Initial clauses in saturation : 35
% 0.28/1.45 # Processed clauses : 53
% 0.28/1.45 # ...of these trivial : 2
% 0.28/1.45 # ...subsumed : 2
% 0.28/1.45 # ...remaining for further processing : 49
% 0.28/1.45 # Other redundant clauses eliminated : 3
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 0
% 0.28/1.45 # Backward-rewritten : 13
% 0.28/1.45 # Generated clauses : 58
% 0.28/1.45 # ...of the previous two non-trivial : 61
% 0.28/1.45 # Contextual simplify-reflections : 2
% 0.28/1.45 # Paramodulations : 52
% 0.28/1.45 # Factorizations : 2
% 0.28/1.45 # Equation resolutions : 3
% 0.28/1.45 # Current number of processed clauses : 32
% 0.28/1.45 # Positive orientable unit clauses : 9
% 0.28/1.45 # Positive unorientable unit clauses: 0
% 0.28/1.45 # Negative unit clauses : 4
% 0.28/1.45 # Non-unit-clauses : 19
% 0.28/1.45 # Current number of unprocessed clauses: 27
% 0.28/1.45 # ...number of literals in the above : 72
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 15
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 101
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 54
% 0.28/1.45 # Non-unit clause-clause subsumptions : 4
% 0.28/1.45 # Unit Clause-clause subsumption calls : 11
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 4
% 0.28/1.45 # BW rewrite match successes : 2
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 3252
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.019 s
% 0.28/1.45 # System time : 0.003 s
% 0.28/1.45 # Total time : 0.022 s
% 0.28/1.45 # Maximum resident set size: 3048 pages
%------------------------------------------------------------------------------