TSTP Solution File: SWV417+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:32 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 2 unt; 0 def)
% Number of atoms : 47 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 15 |; 8 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 2 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co4,conjecture,
! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co4) ).
fof(ax14,axiom,
! [X1,X2] :
( ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) )
=> findmin_pq_res(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax14) ).
fof(ax58,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax58) ).
fof(main4_l7,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main4_l7) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( pi_find_min(triple(X1,X2,X3))
=> ( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> ? [X4] :
( pi_sharp_find_min(i(triple(X1,X2,X3)),X4)
& findmin_cpq_res(triple(X1,X2,X3)) = findmin_pq_res(i(triple(X1,X2,X3)),X4) ) ) ),
inference(assume_negation,[status(cth)],[co4]) ).
fof(c_0_5,negated_conjecture,
! [X8] :
( pi_find_min(triple(esk1_0,esk2_0,esk3_0))
& phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ( ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X8)
| findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)) != findmin_pq_res(i(triple(esk1_0,esk2_0,esk3_0)),X8) ) ),
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,plain,
! [X3,X4] :
( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| findmin_pq_res(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( contains_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( issmallestelement_pq(X3,X4)
| ~ pi_sharp_find_min(X3,X4) )
& ( ~ contains_pq(X3,X4)
| ~ issmallestelement_pq(X3,X4)
| pi_sharp_find_min(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])])]) ).
cnf(c_0_8,negated_conjecture,
( findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)) != findmin_pq_res(i(triple(esk1_0,esk2_0,esk3_0)),X1)
| ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,lemma,
! [X4,X5,X6] :
( ~ phi(findmin_cpq_eff(triple(X4,X5,X6)))
| pi_sharp_find_min(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main4_l7])]) ).
cnf(c_0_13,negated_conjecture,
( X1 != findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))
| ~ pi_sharp_find_min(i(triple(esk1_0,esk2_0,esk3_0)),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,lemma,
( pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 09:28:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.018 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 17
% 0.23/1.42 # Proof object clause steps : 8
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 2
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 64
% 0.23/1.42 # Removed by relevancy pruning/SinE : 29
% 0.23/1.42 # Initial clauses : 52
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 52
% 0.23/1.42 # Processed clauses : 53
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 53
% 0.23/1.42 # Other redundant clauses eliminated : 2
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 51
% 0.23/1.42 # ...of the previous two non-trivial : 40
% 0.23/1.42 # Contextual simplify-reflections : 4
% 0.23/1.42 # Paramodulations : 47
% 0.23/1.42 # Factorizations : 2
% 0.23/1.42 # Equation resolutions : 2
% 0.23/1.42 # Current number of processed clauses : 51
% 0.23/1.42 # Positive orientable unit clauses : 9
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 39
% 0.23/1.42 # Current number of unprocessed clauses: 39
% 0.23/1.42 # ...number of literals in the above : 103
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 274
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 200
% 0.23/1.42 # Non-unit clause-clause subsumptions : 4
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 4426
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.019 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.022 s
% 0.23/1.42 # Maximum resident set size: 3152 pages
%------------------------------------------------------------------------------