TSTP Solution File: PUZ009-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n029.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 : Mon Jul 18 18:19:16 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 112 ( 47 unt; 5 typ; 0 def)
% Number of atoms : 510 ( 138 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 224 ( 97 ~; 127 |; 0 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a_is_a_knight,type,
a_is_a_knight: $o ).
thf(tp_b_is_a_knight,type,
b_is_a_knight: $o ).
thf(tp_c_is_a_knight,type,
c_is_a_knight: $o ).
thf(tp_d_is_a_knight,type,
d_is_a_knight: $o ).
thf(tp_e_is_a_knight,type,
e_is_a_knight: $o ).
thf(1,axiom,
( a_is_a_knight
| ~ c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c17) ).
thf(2,axiom,
( a_is_a_knight
| e_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c16) ).
thf(3,axiom,
( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c15) ).
thf(4,axiom,
( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c14) ).
thf(5,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c13) ).
thf(6,axiom,
( e_is_a_knight
| ~ c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c12) ).
thf(7,axiom,
( e_is_a_knight
| d_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
thf(8,axiom,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
thf(9,axiom,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c9) ).
thf(10,axiom,
( ~ d_is_a_knight
| b_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c8) ).
thf(11,axiom,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c7) ).
thf(12,axiom,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).
thf(13,axiom,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c5) ).
thf(14,axiom,
( b_is_a_knight
| a_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c4) ).
thf(15,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c3) ).
thf(16,axiom,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2) ).
thf(17,axiom,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c1) ).
thf(18,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(19,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[18]) ).
thf(20,negated_conjecture,
b_is_a_knight,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c18) ).
thf(21,plain,
$false = $false,
inference(unfold_def,[status(thm)],[19]) ).
thf(22,plain,
( ( a_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(23,plain,
( ( a_is_a_knight
| e_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(24,plain,
( ( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(25,plain,
( ( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(26,plain,
( ( d_is_a_knight
| a_is_a_knight
| c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(27,plain,
( ( e_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(28,plain,
( ( e_is_a_knight
| d_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(29,plain,
( ( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(30,plain,
( ( ~ d_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(31,plain,
( ( ~ d_is_a_knight
| b_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(32,plain,
( ( ~ d_is_a_knight
| ~ a_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(33,plain,
( ( ~ c_is_a_knight
| ~ d_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(34,plain,
( ( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(35,plain,
( ( b_is_a_knight
| a_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(36,plain,
( ( ~ b_is_a_knight
| ~ a_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(37,plain,
( ( ~ a_is_a_knight
| ~ d_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(38,plain,
( ( ~ a_is_a_knight
| ~ b_is_a_knight )
= $true ),
inference(unfold_def,[status(thm)],[17]) ).
thf(39,plain,
b_is_a_knight = $true,
inference(unfold_def,[status(thm)],[20]) ).
thf(40,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[21]) ).
thf(41,plain,
( ( d_is_a_knight
| e_is_a_knight )
= $true ),
inference(extcnf_combined,[status(esa)],[28]) ).
thf(42,plain,
( ( a_is_a_knight
| b_is_a_knight )
= $true ),
inference(extcnf_combined,[status(esa)],[35]) ).
thf(43,plain,
b_is_a_knight = $true,
inference(copy,[status(thm)],[39]) ).
thf(44,plain,
( ( ~ a_is_a_knight
| ~ b_is_a_knight )
= $true ),
inference(copy,[status(thm)],[38]) ).
thf(45,plain,
( ( ~ a_is_a_knight
| ~ d_is_a_knight )
= $true ),
inference(copy,[status(thm)],[37]) ).
thf(46,plain,
( ( ~ b_is_a_knight
| ~ a_is_a_knight )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(47,plain,
( ( a_is_a_knight
| b_is_a_knight )
= $true ),
inference(copy,[status(thm)],[42]) ).
thf(48,plain,
( ( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(49,plain,
( ( ~ c_is_a_knight
| ~ d_is_a_knight )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(50,plain,
( ( ~ d_is_a_knight
| ~ a_is_a_knight )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(51,plain,
( ( ~ d_is_a_knight
| b_is_a_knight )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(52,plain,
( ( ~ d_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(53,plain,
( ( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(54,plain,
( ( d_is_a_knight
| e_is_a_knight )
= $true ),
inference(copy,[status(thm)],[41]) ).
thf(55,plain,
( ( e_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(56,plain,
( ( d_is_a_knight
| a_is_a_knight
| c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(57,plain,
( ( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(58,plain,
( ( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(59,plain,
( ( a_is_a_knight
| e_is_a_knight )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(60,plain,
( ( a_is_a_knight
| ~ c_is_a_knight )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(61,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[40]) ).
thf(62,plain,
( ( ( ~ a_is_a_knight )
= $true )
| ( ( ~ b_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(63,plain,
( ( ( ~ a_is_a_knight )
= $true )
| ( ( ~ d_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[45]) ).
thf(64,plain,
( ( ( ~ b_is_a_knight )
= $true )
| ( ( ~ a_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(65,plain,
( ( a_is_a_knight = $true )
| ( b_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(66,plain,
( ( ( ~ b_is_a_knight )
= $true )
| ( ( c_is_a_knight
| d_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(67,plain,
( ( ( ~ c_is_a_knight )
= $true )
| ( ( ~ d_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[49]) ).
thf(68,plain,
( ( ( ~ d_is_a_knight )
= $true )
| ( ( ~ a_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(69,plain,
( ( ( ~ d_is_a_knight )
= $true )
| ( b_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(70,plain,
( ( ( ~ d_is_a_knight )
= $true )
| ( ( ~ c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[52]) ).
thf(71,plain,
( ( ( ~ e_is_a_knight )
= $true )
| ( ( ~ d_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(72,plain,
( ( d_is_a_knight = $true )
| ( e_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[54]) ).
thf(73,plain,
( ( e_is_a_knight = $true )
| ( ( ~ c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[55]) ).
thf(74,plain,
( ( d_is_a_knight = $true )
| ( ( a_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[56]) ).
thf(75,plain,
( ( d_is_a_knight = $true )
| ( ( ~ b_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[57]) ).
thf(76,plain,
( ( ( ~ a_is_a_knight )
= $true )
| ( ( ~ e_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[58]) ).
thf(77,plain,
( ( a_is_a_knight = $true )
| ( e_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[59]) ).
thf(78,plain,
( ( a_is_a_knight = $true )
| ( ( ~ c_is_a_knight )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[60]) ).
thf(79,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[61]) ).
thf(80,plain,
( ( a_is_a_knight = $false )
| ( ( ~ b_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[62]) ).
thf(81,plain,
( ( a_is_a_knight = $false )
| ( ( ~ d_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[63]) ).
thf(82,plain,
( ( b_is_a_knight = $false )
| ( ( ~ a_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[64]) ).
thf(83,plain,
( ( b_is_a_knight = $false )
| ( ( c_is_a_knight
| d_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[66]) ).
thf(84,plain,
( ( c_is_a_knight = $false )
| ( ( ~ d_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[67]) ).
thf(85,plain,
( ( d_is_a_knight = $false )
| ( ( ~ a_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[68]) ).
thf(86,plain,
( ( d_is_a_knight = $false )
| ( b_is_a_knight = $true ) ),
inference(extcnf_not_pos,[status(thm)],[69]) ).
thf(87,plain,
( ( d_is_a_knight = $false )
| ( ( ~ c_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[70]) ).
thf(88,plain,
( ( e_is_a_knight = $false )
| ( ( ~ d_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[71]) ).
thf(89,plain,
( ( c_is_a_knight = $false )
| ( e_is_a_knight = $true ) ),
inference(extcnf_not_pos,[status(thm)],[73]) ).
thf(90,plain,
( ( a_is_a_knight = $true )
| ( c_is_a_knight = $true )
| ( d_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[74]) ).
thf(91,plain,
( ( ( ~ b_is_a_knight )
= $true )
| ( c_is_a_knight = $true )
| ( d_is_a_knight = $true ) ),
inference(extcnf_or_pos,[status(thm)],[75]) ).
thf(92,plain,
( ( a_is_a_knight = $false )
| ( ( ~ e_is_a_knight
| c_is_a_knight )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[76]) ).
thf(93,plain,
( ( c_is_a_knight = $false )
| ( a_is_a_knight = $true ) ),
inference(extcnf_not_pos,[status(thm)],[78]) ).
thf(94,plain,
( ( b_is_a_knight = $false )
| ( a_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[80]) ).
thf(95,plain,
( ( d_is_a_knight = $false )
| ( a_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[81]) ).
thf(96,plain,
( ( a_is_a_knight = $false )
| ( b_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[82]) ).
thf(97,plain,
( ( c_is_a_knight = $true )
| ( d_is_a_knight = $true )
| ( b_is_a_knight = $false ) ),
inference(extcnf_or_pos,[status(thm)],[83]) ).
thf(98,plain,
( ( d_is_a_knight = $false )
| ( c_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[84]) ).
thf(99,plain,
( ( a_is_a_knight = $false )
| ( d_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[85]) ).
thf(100,plain,
( ( c_is_a_knight = $false )
| ( d_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[87]) ).
thf(101,plain,
( ( ( ~ d_is_a_knight )
= $true )
| ( c_is_a_knight = $true )
| ( e_is_a_knight = $false ) ),
inference(extcnf_or_pos,[status(thm)],[88]) ).
thf(102,plain,
( ( b_is_a_knight = $false )
| ( c_is_a_knight = $true )
| ( d_is_a_knight = $true ) ),
inference(extcnf_not_pos,[status(thm)],[91]) ).
thf(103,plain,
( ( ( ~ e_is_a_knight )
= $true )
| ( c_is_a_knight = $true )
| ( a_is_a_knight = $false ) ),
inference(extcnf_or_pos,[status(thm)],[92]) ).
thf(104,plain,
( ( d_is_a_knight = $false )
| ( c_is_a_knight = $true )
| ( e_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[101]) ).
thf(105,plain,
( ( e_is_a_knight = $false )
| ( c_is_a_knight = $true )
| ( a_is_a_knight = $false ) ),
inference(extcnf_not_pos,[status(thm)],[103]) ).
thf(106,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[43,105,104,102,100,99,98,97,96,95,94,93,90,89,86,79,77,72,65]) ).
thf(107,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 03:03:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 18
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.35 (rf:0,axioms:18,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:20,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.12/0.37
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:18,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:106,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 107 ****
% 0.12/0.37 %**** clause counter: 106 ****
% 0.12/0.37
% 0.12/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:18,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:106,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------