TSTP Solution File: SYN727+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN727+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n008.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 : Thu Jul 21 08:29:25 EDT 2022
% Result : Theorem 0.15s 0.39s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 81 ( 22 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 99 ( 9 ~; 6 |; 3 &; 74 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 31 !; 9 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_bruce,type,
bruce: $i ).
thf(tp_likes,type,
likes: $i > $i > $o ).
thf(tp_lyle,type,
lyle: $i ).
thf(tp_sK1_V,type,
sK1_V: $i > $i ).
thf(1,conjecture,
( ( ! [X: $i] : ( likes @ X @ bruce )
& ! [Y: $i] :
( ? [Z: $i] : ( likes @ Y @ Z )
=> ( likes @ lyle @ Y ) ) )
=> ? [U: $i] :
! [V: $i] : ( likes @ U @ V ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm68) ).
thf(2,negated_conjecture,
( ( ( ! [X: $i] : ( likes @ X @ bruce )
& ! [Y: $i] :
( ? [Z: $i] : ( likes @ Y @ Z )
=> ( likes @ lyle @ Y ) ) )
=> ? [U: $i] :
! [V: $i] : ( likes @ U @ V ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ! [X: $i] : ( likes @ X @ bruce )
& ! [Y: $i] :
( ? [Z: $i] : ( likes @ Y @ Z )
=> ( likes @ lyle @ Y ) ) )
=> ? [U: $i] :
! [V: $i] : ( likes @ U @ V ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] : ( likes @ X @ bruce ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Y: $i] :
( ? [Z: $i] : ( likes @ Y @ Z )
=> ( likes @ lyle @ Y ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ? [U: $i] :
! [V: $i] : ( likes @ U @ V ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ? [U: $i] :
! [V: $i] : ( likes @ U @ V ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [U: $i] :
~ ( likes @ U @ ( sK1_V @ U ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(9,plain,
( ( ! [Y: $i] :
( ! [Z: $i] :
~ ( likes @ Y @ Z )
| ( likes @ lyle @ Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(10,plain,
( ( ! [Y: $i] :
( ! [Z: $i] :
~ ( likes @ Y @ Z )
| ( likes @ lyle @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [X: $i] : ( likes @ X @ bruce ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(12,plain,
( ( ! [U: $i] :
~ ( likes @ U @ ( sK1_V @ U ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
! [SV1: $i] :
( ( ! [SY5: $i] :
~ ( likes @ SV1 @ SY5 )
| ( likes @ lyle @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV2: $i] :
( ( likes @ SV2 @ bruce )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
! [SV3: $i] :
( ( ~ ( likes @ SV3 @ ( sK1_V @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV1: $i] :
( ( ( ! [SY5: $i] :
~ ( likes @ SV1 @ SY5 ) )
= $true )
| ( ( likes @ lyle @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV3: $i] :
( ( likes @ SV3 @ ( sK1_V @ SV3 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(18,plain,
! [SV4: $i,SV1: $i] :
( ( ( ~ ( likes @ SV1 @ SV4 ) )
= $true )
| ( ( likes @ lyle @ SV1 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV4: $i,SV1: $i] :
( ( ( likes @ SV1 @ SV4 )
= $false )
| ( ( likes @ lyle @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(20,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,19,17]) ).
thf(21,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN727+1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jul 12 00:20:23 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37
% 0.15/0.37 No.of.Axioms: 0
% 0.15/0.37
% 0.15/0.37 Length.of.Defs: 0
% 0.15/0.37
% 0.15/0.37 Contains.Choice.Funs: false
% 0.15/0.37 (rf:0,axioms:0,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:2,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.15/0.39
% 0.15/0.39 ********************************
% 0.15/0.39 * All subproblems solved! *
% 0.15/0.39 ********************************
% 0.15/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:20,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.15/0.39
% 0.15/0.39 %**** Beginning of derivation protocol ****
% 0.15/0.39 % SZS output start CNFRefutation
% See solution above
% 0.15/0.39
% 0.15/0.39 %**** End of derivation protocol ****
% 0.15/0.39 %**** no. of clauses in derivation: 21 ****
% 0.15/0.39 %**** clause counter: 20 ****
% 0.15/0.39
% 0.15/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:20,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------