TSTP Solution File: PUZ001+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ001+1 : TPTP v5.4.0. Released v2.0.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
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Mar 15 18:26:31 EDT 2013
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 63 ( 22 unt; 0 def)
% Number of atoms : 116 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 95 ( 42 ~; 40 |; 3 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 51 ( 0 sgn 35 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
~ equal(agatha,butler),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_11) ).
fof(2,axiom,
! [X1] :
? [X2] : ~ hates(X1,X2),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_10) ).
fof(6,axiom,
! [X1] :
( lives(X1)
=> ( equal(X1,agatha)
| equal(X1,butler)
| equal(X1,charles) ) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_3) ).
fof(7,axiom,
? [X1] :
( lives(X1)
& killed(X1,agatha) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_1) ).
fof(8,axiom,
! [X1] :
( ~ equal(X1,butler)
=> hates(agatha,X1) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_7) ).
fof(9,axiom,
! [X1] :
( hates(agatha,X1)
=> ~ hates(charles,X1) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_6) ).
fof(10,axiom,
! [X1,X2] :
( killed(X1,X2)
=> ~ richer(X1,X2) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_5) ).
fof(11,axiom,
! [X1,X2] :
( killed(X1,X2)
=> hates(X1,X2) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_4) ).
fof(12,conjecture,
killed(agatha,agatha),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55) ).
fof(13,axiom,
! [X1] :
( hates(agatha,X1)
=> hates(butler,X1) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_9) ).
fof(14,axiom,
! [X1] :
( ~ richer(X1,agatha)
=> hates(butler,X1) ),
file('/tmp/tmp3Mt06a/sel_PUZ001+1.p_1',pel55_8) ).
fof(15,negated_conjecture,
~ killed(agatha,agatha),
inference(assume_negation,[status(cth)],[12]) ).
fof(16,plain,
! [X1] :
? [X2] : ~ hates(X1,X2),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(17,plain,
! [X1] :
( hates(agatha,X1)
=> ~ hates(charles,X1) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(18,plain,
! [X1,X2] :
( killed(X1,X2)
=> ~ richer(X1,X2) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(19,negated_conjecture,
~ killed(agatha,agatha),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(20,plain,
! [X1] :
( ~ richer(X1,agatha)
=> hates(butler,X1) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
cnf(21,plain,
agatha != butler,
inference(split_conjunct,[status(thm)],[1]) ).
fof(22,plain,
! [X3] :
? [X4] : ~ hates(X3,X4),
inference(variable_rename,[status(thm)],[16]) ).
fof(23,plain,
! [X3] : ~ hates(X3,esk1_1(X3)),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,plain,
~ hates(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[23]) ).
fof(28,plain,
! [X1] :
( ~ lives(X1)
| equal(X1,agatha)
| equal(X1,butler)
| equal(X1,charles) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(29,plain,
! [X2] :
( ~ lives(X2)
| equal(X2,agatha)
| equal(X2,butler)
| equal(X2,charles) ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(30,plain,
( X1 = charles
| X1 = butler
| X1 = agatha
| ~ lives(X1) ),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
? [X2] :
( lives(X2)
& killed(X2,agatha) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(32,plain,
( lives(esk2_0)
& killed(esk2_0,agatha) ),
inference(skolemize,[status(esa)],[31]) ).
cnf(33,plain,
killed(esk2_0,agatha),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(34,plain,
lives(esk2_0),
inference(split_conjunct,[status(thm)],[32]) ).
fof(35,plain,
! [X1] :
( equal(X1,butler)
| hates(agatha,X1) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(36,plain,
! [X2] :
( equal(X2,butler)
| hates(agatha,X2) ),
inference(variable_rename,[status(thm)],[35]) ).
cnf(37,plain,
( hates(agatha,X1)
| X1 = butler ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(38,plain,
! [X1] :
( ~ hates(agatha,X1)
| ~ hates(charles,X1) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(39,plain,
! [X2] :
( ~ hates(agatha,X2)
| ~ hates(charles,X2) ),
inference(variable_rename,[status(thm)],[38]) ).
cnf(40,plain,
( ~ hates(charles,X1)
| ~ hates(agatha,X1) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(41,plain,
! [X1,X2] :
( ~ killed(X1,X2)
| ~ richer(X1,X2) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(42,plain,
! [X3,X4] :
( ~ killed(X3,X4)
| ~ richer(X3,X4) ),
inference(variable_rename,[status(thm)],[41]) ).
cnf(43,plain,
( ~ richer(X1,X2)
| ~ killed(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(44,plain,
! [X1,X2] :
( ~ killed(X1,X2)
| hates(X1,X2) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(45,plain,
! [X3,X4] :
( ~ killed(X3,X4)
| hates(X3,X4) ),
inference(variable_rename,[status(thm)],[44]) ).
cnf(46,plain,
( hates(X1,X2)
| ~ killed(X1,X2) ),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(47,negated_conjecture,
~ killed(agatha,agatha),
inference(split_conjunct,[status(thm)],[19]) ).
fof(48,plain,
! [X1] :
( ~ hates(agatha,X1)
| hates(butler,X1) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(49,plain,
! [X2] :
( ~ hates(agatha,X2)
| hates(butler,X2) ),
inference(variable_rename,[status(thm)],[48]) ).
cnf(50,plain,
( hates(butler,X1)
| ~ hates(agatha,X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,plain,
! [X1] :
( richer(X1,agatha)
| hates(butler,X1) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(52,plain,
! [X2] :
( richer(X2,agatha)
| hates(butler,X2) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( hates(butler,X1)
| richer(X1,agatha) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
( charles = esk2_0
| butler = esk2_0
| agatha = esk2_0 ),
inference(spm,[status(thm)],[30,34,theory(equality)]) ).
cnf(55,plain,
hates(esk2_0,agatha),
inference(spm,[status(thm)],[46,33,theory(equality)]) ).
cnf(57,plain,
( hates(butler,X1)
| ~ killed(X1,agatha) ),
inference(spm,[status(thm)],[43,53,theory(equality)]) ).
cnf(58,plain,
~ hates(agatha,esk1_1(butler)),
inference(spm,[status(thm)],[24,50,theory(equality)]) ).
cnf(64,plain,
( hates(charles,agatha)
| esk2_0 = agatha
| esk2_0 = butler ),
inference(spm,[status(thm)],[55,54,theory(equality)]) ).
cnf(67,plain,
hates(butler,esk2_0),
inference(spm,[status(thm)],[57,33,theory(equality)]) ).
cnf(69,plain,
butler = esk1_1(butler),
inference(spm,[status(thm)],[58,37,theory(equality)]) ).
cnf(70,plain,
~ hates(butler,butler),
inference(spm,[status(thm)],[24,69,theory(equality)]) ).
cnf(97,plain,
( esk2_0 = butler
| esk2_0 = agatha
| ~ hates(agatha,agatha) ),
inference(spm,[status(thm)],[40,64,theory(equality)]) ).
cnf(104,plain,
( esk2_0 = agatha
| esk2_0 = butler
| butler = agatha ),
inference(spm,[status(thm)],[97,37,theory(equality)]) ).
cnf(105,plain,
( esk2_0 = agatha
| esk2_0 = butler ),
inference(sr,[status(thm)],[104,21,theory(equality)]) ).
cnf(110,plain,
( hates(butler,butler)
| esk2_0 = agatha ),
inference(spm,[status(thm)],[67,105,theory(equality)]) ).
cnf(114,plain,
esk2_0 = agatha,
inference(sr,[status(thm)],[110,70,theory(equality)]) ).
cnf(121,plain,
killed(agatha,agatha),
inference(rw,[status(thm)],[33,114,theory(equality)]) ).
cnf(122,plain,
$false,
inference(sr,[status(thm)],[121,47,theory(equality)]) ).
cnf(123,plain,
$false,
122,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/tptp/TPTP/Problems/PUZ/PUZ001+1.p
% --creating new selector for []
% -running prover on /tmp/tmp3Mt06a/sel_PUZ001+1.p_1 with time limit 29
% -running prover with command ['/home/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmp3Mt06a/sel_PUZ001+1.p_1']
% -prover status Theorem
% Problem PUZ001+1.p solved in phase 0.
% % SZS status Theorem for /home/tptp/TPTP/Problems/PUZ/PUZ001+1.p
% % SZS status Ended for /home/tptp/TPTP/Problems/PUZ/PUZ001+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
%
%------------------------------------------------------------------------------