TSTP Solution File: SWV373+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV373+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 12:28:32 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 66 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 33 ~; 17 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 64 ( 9 sgn 45 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/tmp/tmp7f5A6x/sel_SWV373+1.p_1',ax51) ).
fof(21,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/tmp/tmp7f5A6x/sel_SWV373+1.p_1',ax39) ).
fof(23,axiom,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
file('/tmp/tmp7f5A6x/sel_SWV373+1.p_1',l9_l10) ).
fof(24,conjecture,
! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/tmp/tmp7f5A6x/sel_SWV373+1.p_1',l9_co) ).
fof(25,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(30,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(87,plain,
! [X1,X2,X3,X4] :
( X2 = create_slb
| findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(88,plain,
! [X5,X6,X7,X8] :
( X6 = create_slb
| findmin_cpq_res(triple(X5,X6,X7)) = findmin_pqp_res(X5) ),
inference(variable_rename,[status(thm)],[87]) ).
cnf(89,plain,
( findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1)
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(95,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_slb(X2,X4) )
& ( ~ contains_slb(X2,X4)
| contains_cpq(triple(X1,X2,X3),X4) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(96,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(variable_rename,[status(thm)],[95]) ).
cnf(97,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(102,plain,
! [X1,X2,X3] :
( ~ ok(findmin_cpq_eff(triple(X1,X2,X3)))
| ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(103,plain,
! [X4,X5,X6] :
( ~ ok(findmin_cpq_eff(triple(X4,X5,X6)))
| ( X5 != create_slb
& contains_slb(X5,findmin_pqp_res(X4))
& less_than(lookup_slb(X5,findmin_pqp_res(X4)),findmin_pqp_res(X4)) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,plain,
! [X4,X5,X6] :
( ( X5 != create_slb
| ~ ok(findmin_cpq_eff(triple(X4,X5,X6))) )
& ( contains_slb(X5,findmin_pqp_res(X4))
| ~ ok(findmin_cpq_eff(triple(X4,X5,X6))) )
& ( less_than(lookup_slb(X5,findmin_pqp_res(X4)),findmin_pqp_res(X4))
| ~ ok(findmin_cpq_eff(triple(X4,X5,X6))) ) ),
inference(distribute,[status(thm)],[103]) ).
cnf(106,plain,
( contains_slb(X2,findmin_pqp_res(X1))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(107,plain,
( ~ ok(findmin_cpq_eff(triple(X1,X2,X3)))
| X2 != create_slb ),
inference(split_conjunct,[status(thm)],[104]) ).
fof(108,negated_conjecture,
? [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
& ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(109,negated_conjecture,
? [X4,X5,X6] :
( ~ contains_cpq(triple(X4,X5,X6),findmin_cpq_res(triple(X4,X5,X6)))
& ok(findmin_cpq_eff(triple(X4,X5,X6))) ),
inference(variable_rename,[status(thm)],[108]) ).
fof(110,negated_conjecture,
( ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[109]) ).
cnf(111,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(112,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(118,negated_conjecture,
create_slb != esk2_0,
inference(spm,[status(thm)],[107,111,theory(equality)]) ).
cnf(119,negated_conjecture,
~ contains_slb(esk2_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(spm,[status(thm)],[112,97,theory(equality)]) ).
cnf(129,negated_conjecture,
contains_slb(esk2_0,findmin_pqp_res(esk1_0)),
inference(spm,[status(thm)],[106,111,theory(equality)]) ).
cnf(178,negated_conjecture,
( create_slb = esk2_0
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[119,89,theory(equality)]) ).
cnf(179,negated_conjecture,
( create_slb = esk2_0
| $false ),
inference(rw,[status(thm)],[178,129,theory(equality)]) ).
cnf(180,negated_conjecture,
create_slb = esk2_0,
inference(cn,[status(thm)],[179,theory(equality)]) ).
cnf(181,negated_conjecture,
$false,
inference(sr,[status(thm)],[180,118,theory(equality)]) ).
cnf(182,negated_conjecture,
$false,
181,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV373+1.p
% --creating new selector for [SWV007+0.ax, SWV007+2.ax, SWV007+3.ax]
% -running prover on /tmp/tmp7f5A6x/sel_SWV373+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV373+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV373+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV373+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------