TSTP Solution File: SYN036+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN036+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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 : 300s
% DateTime : Tue May 21 08:33:46 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 55
% Number of leaves : 19
% Syntax : Number of formulae : 124 ( 8 unt; 0 def)
% Number of atoms : 478 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 519 ( 165 ~; 257 |; 51 &)
% ( 32 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-1 aty)
% Number of variables : 160 ( 108 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f239,plain,
$false,
inference(subsumption_resolution,[],[f238,f220]) ).
fof(f220,plain,
sP4,
inference(subsumption_resolution,[],[f219,f172]) ).
fof(f172,plain,
sP0,
inference(subsumption_resolution,[],[f171,f157]) ).
fof(f157,plain,
! [X0] :
( big_p(X0)
| sP0 ),
inference(duplicate_literal_removal,[],[f154]) ).
fof(f154,plain,
! [X0] :
( sP0
| big_p(X0)
| sP0 ),
inference(resolution,[],[f153,f110]) ).
fof(f110,plain,
! [X1] :
( ~ sP3
| big_p(X1)
| sP0 ),
inference(subsumption_resolution,[],[f109,f46]) ).
fof(f46,plain,
! [X6,X7] :
( ~ big_p(X7)
| big_p(X6)
| ~ sP3 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ( sP3
| ( ( ~ big_p(sK6)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| big_p(sK7) ) ) )
& ( ( ( big_p(sK8)
| ~ big_p(sK9) )
& ( ! [X6] : big_p(X6)
| ! [X7] : ~ big_p(X7) ) )
| ~ sP3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f14,f18,f17,f16,f15]) ).
fof(f15,plain,
( ? [X0] : ~ big_p(X0)
=> ~ big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X3] : big_p(X3)
=> big_p(sK7) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X4] : big_p(X4)
=> big_p(sK8) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X5] : ~ big_p(X5)
=> ~ big_p(sK9) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ( sP3
| ( ( ? [X0] : ~ big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| ? [X3] : big_p(X3) ) ) )
& ( ( ( ? [X4] : big_p(X4)
| ? [X5] : ~ big_p(X5) )
& ( ! [X6] : big_p(X6)
| ! [X7] : ~ big_p(X7) ) )
| ~ sP3 ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
( ( sP3
| ( ( ? [X7] : ~ big_p(X7)
| ! [X6] : ~ big_p(X6) )
& ( ! [X7] : big_p(X7)
| ? [X6] : big_p(X6) ) ) )
& ( ( ( ? [X6] : big_p(X6)
| ? [X7] : ~ big_p(X7) )
& ( ! [X7] : big_p(X7)
| ! [X6] : ~ big_p(X6) ) )
| ~ sP3 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP3
<=> ( ? [X6] : big_p(X6)
<=> ! [X7] : big_p(X7) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f109,plain,
! [X0,X1] :
( sP0
| big_p(X0)
| big_p(X1)
| ~ sP3 ),
inference(resolution,[],[f60,f46]) ).
fof(f60,plain,
! [X0] :
( big_p(sK16(X0))
| sP0
| big_p(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( ( sP0
| ! [X0] :
( ( ~ big_p(sK16(X0))
| ~ big_p(X0) )
& ( big_p(sK16(X0))
| big_p(X0) ) ) )
& ( ! [X3] :
( ( big_p(sK17)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(sK17) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17])],[f33,f35,f34]) ).
fof(f34,plain,
! [X0] :
( ? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) )
=> ( ( ~ big_p(sK16(X0))
| ~ big_p(X0) )
& ( big_p(sK16(X0))
| big_p(X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
( ? [X2] :
! [X3] :
( ( big_p(X2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(X2) ) )
=> ! [X3] :
( ( big_p(sK17)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(sK17) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) ) )
& ( ? [X2] :
! [X3] :
( ( big_p(X2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(X2) ) )
| ~ sP0 ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) ) )
& ( ? [X0] :
! [X1] :
( ( big_p(X0)
| ~ big_p(X1) )
& ( big_p(X1)
| ~ big_p(X0) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( sP0
<=> ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f153,plain,
( sP3
| sP0 ),
inference(subsumption_resolution,[],[f152,f136]) ).
fof(f136,plain,
( sP1
| sP0 ),
inference(subsumption_resolution,[],[f135,f129]) ).
fof(f129,plain,
! [X0] :
( big_q(X0)
| sP0
| sP1 ),
inference(subsumption_resolution,[],[f126,f122]) ).
fof(f122,plain,
( sP2
| sP0
| sP1 ),
inference(subsumption_resolution,[],[f120,f112]) ).
fof(f112,plain,
! [X0] :
( big_p(X0)
| sP0
| sP2
| sP1 ),
inference(duplicate_literal_removal,[],[f111]) ).
fof(f111,plain,
! [X0] :
( big_p(X0)
| sP0
| sP0
| sP2
| sP1 ),
inference(resolution,[],[f110,f74]) ).
fof(f74,plain,
( sP3
| sP0
| sP2
| sP1 ),
inference(resolution,[],[f44,f69]) ).
fof(f69,plain,
( ~ sP4
| sP2
| sP3 ),
inference(resolution,[],[f40,f63]) ).
fof(f63,plain,
( ~ sP5
| ~ sP4 ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
( ( ~ sP5
| ~ sP4 )
& ( sP5
| sP4 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
( sP4
<~> sP5 ),
inference(definition_folding,[],[f3,f9,f8,f7,f6,f5,f4]) ).
fof(f5,plain,
( sP1
<=> ( ? [X2] : big_q(X2)
<=> ! [X3] : big_q(X3) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f6,plain,
( sP2
<=> ? [X4] :
! [X5] :
( big_q(X4)
<=> big_q(X5) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f8,plain,
( sP4
<=> ( sP0
<=> sP1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f9,plain,
( sP5
<=> ( sP2
<=> sP3 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f3,plain,
( ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X2] : big_q(X2)
<=> ! [X3] : big_q(X3) ) )
<~> ( ? [X4] :
! [X5] :
( big_q(X4)
<=> big_q(X5) )
<=> ( ? [X6] : big_p(X6)
<=> ! [X7] : big_p(X7) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X2] : big_q(X2)
<=> ! [X3] : big_q(X3) ) )
<=> ( ? [X4] :
! [X5] :
( big_q(X4)
<=> big_q(X5) )
<=> ( ? [X6] : big_p(X6)
<=> ! [X7] : big_p(X7) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X2] : big_q(X2)
<=> ! [X3] : big_q(X3) ) )
<=> ( ? [X4] :
! [X5] :
( big_q(X4)
<=> big_q(X5) )
<=> ( ? [X6] : big_p(X6)
<=> ! [X7] : big_p(X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel34) ).
fof(f40,plain,
( sP5
| sP3
| sP2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP5
| ( ( ~ sP3
| ~ sP2 )
& ( sP3
| sP2 ) ) )
& ( ( ( sP2
| ~ sP3 )
& ( sP3
| ~ sP2 ) )
| ~ sP5 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f44,plain,
( sP4
| sP1
| sP0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( ( sP4
| ( ( ~ sP1
| ~ sP0 )
& ( sP1
| sP0 ) ) )
& ( ( ( sP0
| ~ sP1 )
& ( sP1
| ~ sP0 ) )
| ~ sP4 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f120,plain,
! [X0] :
( sP0
| ~ big_p(X0)
| sP2
| sP1 ),
inference(duplicate_literal_removal,[],[f118]) ).
fof(f118,plain,
! [X0] :
( sP0
| ~ big_p(X0)
| sP0
| sP2
| sP1 ),
inference(resolution,[],[f61,f112]) ).
fof(f61,plain,
! [X0] :
( ~ big_p(sK16(X0))
| sP0
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f126,plain,
! [X0] :
( sP1
| sP0
| big_q(X0)
| ~ sP2 ),
inference(resolution,[],[f125,f50]) ).
fof(f50,plain,
! [X3] :
( ~ big_q(sK11)
| big_q(X3)
| ~ sP2 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( ( sP2
| ! [X0] :
( ( ~ big_q(sK10(X0))
| ~ big_q(X0) )
& ( big_q(sK10(X0))
| big_q(X0) ) ) )
& ( ! [X3] :
( ( big_q(sK11)
| ~ big_q(X3) )
& ( big_q(X3)
| ~ big_q(sK11) ) )
| ~ sP2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f21,f23,f22]) ).
fof(f22,plain,
! [X0] :
( ? [X1] :
( ( ~ big_q(X1)
| ~ big_q(X0) )
& ( big_q(X1)
| big_q(X0) ) )
=> ( ( ~ big_q(sK10(X0))
| ~ big_q(X0) )
& ( big_q(sK10(X0))
| big_q(X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ? [X2] :
! [X3] :
( ( big_q(X2)
| ~ big_q(X3) )
& ( big_q(X3)
| ~ big_q(X2) ) )
=> ! [X3] :
( ( big_q(sK11)
| ~ big_q(X3) )
& ( big_q(X3)
| ~ big_q(sK11) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ( sP2
| ! [X0] :
? [X1] :
( ( ~ big_q(X1)
| ~ big_q(X0) )
& ( big_q(X1)
| big_q(X0) ) ) )
& ( ? [X2] :
! [X3] :
( ( big_q(X2)
| ~ big_q(X3) )
& ( big_q(X3)
| ~ big_q(X2) ) )
| ~ sP2 ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
( ( sP2
| ! [X4] :
? [X5] :
( ( ~ big_q(X5)
| ~ big_q(X4) )
& ( big_q(X5)
| big_q(X4) ) ) )
& ( ? [X4] :
! [X5] :
( ( big_q(X4)
| ~ big_q(X5) )
& ( big_q(X5)
| ~ big_q(X4) ) )
| ~ sP2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f125,plain,
( big_q(sK11)
| sP1
| sP0 ),
inference(duplicate_literal_removal,[],[f123]) ).
fof(f123,plain,
( sP0
| sP1
| big_q(sK11)
| sP1 ),
inference(resolution,[],[f122,f92]) ).
fof(f92,plain,
( ~ sP2
| big_q(sK11)
| sP1 ),
inference(subsumption_resolution,[],[f90,f51]) ).
fof(f51,plain,
! [X3] :
( ~ big_q(X3)
| big_q(sK11)
| ~ sP2 ),
inference(cnf_transformation,[],[f24]) ).
fof(f90,plain,
! [X0] :
( big_q(X0)
| sP1
| big_q(sK11)
| ~ sP2 ),
inference(resolution,[],[f56,f51]) ).
fof(f56,plain,
! [X2] :
( big_q(X2)
| big_q(sK13)
| sP1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( ( sP1
| ( ( ~ big_q(sK12)
| ! [X1] : ~ big_q(X1) )
& ( ! [X2] : big_q(X2)
| big_q(sK13) ) ) )
& ( ( ( big_q(sK14)
| ~ big_q(sK15) )
& ( ! [X6] : big_q(X6)
| ! [X7] : ~ big_q(X7) ) )
| ~ sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f26,f30,f29,f28,f27]) ).
fof(f27,plain,
( ? [X0] : ~ big_q(X0)
=> ~ big_q(sK12) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( ? [X3] : big_q(X3)
=> big_q(sK13) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( ? [X4] : big_q(X4)
=> big_q(sK14) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
( ? [X5] : ~ big_q(X5)
=> ~ big_q(sK15) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ( sP1
| ( ( ? [X0] : ~ big_q(X0)
| ! [X1] : ~ big_q(X1) )
& ( ! [X2] : big_q(X2)
| ? [X3] : big_q(X3) ) ) )
& ( ( ( ? [X4] : big_q(X4)
| ? [X5] : ~ big_q(X5) )
& ( ! [X6] : big_q(X6)
| ! [X7] : ~ big_q(X7) ) )
| ~ sP1 ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
( ( sP1
| ( ( ? [X3] : ~ big_q(X3)
| ! [X2] : ~ big_q(X2) )
& ( ! [X3] : big_q(X3)
| ? [X2] : big_q(X2) ) ) )
& ( ( ( ? [X2] : big_q(X2)
| ? [X3] : ~ big_q(X3) )
& ( ! [X3] : big_q(X3)
| ! [X2] : ~ big_q(X2) ) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f135,plain,
! [X0] :
( sP0
| sP1
| ~ big_q(X0) ),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f134,plain,
! [X0] :
( sP0
| sP1
| sP1
| ~ big_q(X0) ),
inference(resolution,[],[f129,f57]) ).
fof(f57,plain,
! [X1] :
( ~ big_q(sK12)
| sP1
| ~ big_q(X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f152,plain,
( sP3
| sP0
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f148]) ).
fof(f148,plain,
( sP3
| sP0
| ~ sP1
| sP0 ),
inference(resolution,[],[f147,f43]) ).
fof(f43,plain,
( ~ sP4
| ~ sP1
| sP0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f147,plain,
( sP4
| sP3
| sP0 ),
inference(resolution,[],[f145,f65]) ).
fof(f65,plain,
( ~ sP2
| sP3
| sP4 ),
inference(resolution,[],[f38,f62]) ).
fof(f62,plain,
( sP5
| sP4 ),
inference(cnf_transformation,[],[f37]) ).
fof(f38,plain,
( ~ sP5
| ~ sP2
| sP3 ),
inference(cnf_transformation,[],[f11]) ).
fof(f145,plain,
( sP2
| sP0 ),
inference(subsumption_resolution,[],[f144,f137]) ).
fof(f137,plain,
! [X0] :
( big_q(X0)
| sP0
| sP2 ),
inference(resolution,[],[f136,f104]) ).
fof(f104,plain,
! [X1] :
( ~ sP1
| big_q(X1)
| sP2 ),
inference(subsumption_resolution,[],[f102,f54]) ).
fof(f54,plain,
! [X6,X7] :
( ~ big_q(X7)
| big_q(X6)
| ~ sP1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f102,plain,
! [X0,X1] :
( sP2
| big_q(X0)
| big_q(X1)
| ~ sP1 ),
inference(resolution,[],[f52,f54]) ).
fof(f52,plain,
! [X0] :
( big_q(sK10(X0))
| sP2
| big_q(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f144,plain,
! [X0] :
( sP0
| sP2
| ~ big_q(X0) ),
inference(duplicate_literal_removal,[],[f141]) ).
fof(f141,plain,
! [X0] :
( sP0
| sP2
| sP2
| ~ big_q(X0) ),
inference(resolution,[],[f137,f53]) ).
fof(f53,plain,
! [X0] :
( ~ big_q(sK10(X0))
| sP2
| ~ big_q(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f171,plain,
! [X0] :
( sP0
| ~ big_p(X0) ),
inference(duplicate_literal_removal,[],[f169]) ).
fof(f169,plain,
! [X0] :
( sP0
| sP0
| ~ big_p(X0) ),
inference(resolution,[],[f157,f61]) ).
fof(f219,plain,
( sP4
| ~ sP0 ),
inference(resolution,[],[f217,f45]) ).
fof(f45,plain,
( ~ sP1
| sP4
| ~ sP0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f217,plain,
sP1,
inference(subsumption_resolution,[],[f216,f210]) ).
fof(f210,plain,
! [X0] :
( big_q(X0)
| sP1 ),
inference(subsumption_resolution,[],[f207,f195]) ).
fof(f195,plain,
( sP2
| sP1 ),
inference(subsumption_resolution,[],[f192,f172]) ).
fof(f192,plain,
( sP2
| ~ sP0
| sP1 ),
inference(resolution,[],[f187,f42]) ).
fof(f42,plain,
( ~ sP4
| ~ sP0
| sP1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f187,plain,
( sP4
| sP2 ),
inference(resolution,[],[f184,f66]) ).
fof(f66,plain,
( ~ sP3
| sP2
| sP4 ),
inference(resolution,[],[f39,f62]) ).
fof(f39,plain,
( ~ sP5
| ~ sP3
| sP2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f184,plain,
sP3,
inference(subsumption_resolution,[],[f183,f177]) ).
fof(f177,plain,
! [X0] :
( big_p(X0)
| sP3 ),
inference(subsumption_resolution,[],[f174,f172]) ).
fof(f174,plain,
! [X0] :
( sP3
| big_p(X0)
| ~ sP0 ),
inference(resolution,[],[f173,f58]) ).
fof(f58,plain,
! [X3] :
( ~ big_p(sK17)
| big_p(X3)
| ~ sP0 ),
inference(cnf_transformation,[],[f36]) ).
fof(f173,plain,
( big_p(sK17)
| sP3 ),
inference(resolution,[],[f172,f101]) ).
fof(f101,plain,
( ~ sP0
| big_p(sK17)
| sP3 ),
inference(subsumption_resolution,[],[f100,f59]) ).
fof(f59,plain,
! [X3] :
( ~ big_p(X3)
| big_p(sK17)
| ~ sP0 ),
inference(cnf_transformation,[],[f36]) ).
fof(f100,plain,
! [X0] :
( big_p(sK17)
| ~ sP0
| big_p(X0)
| sP3 ),
inference(resolution,[],[f59,f48]) ).
fof(f48,plain,
! [X2] :
( big_p(X2)
| big_p(sK7)
| sP3 ),
inference(cnf_transformation,[],[f19]) ).
fof(f183,plain,
! [X0] :
( sP3
| ~ big_p(X0) ),
inference(duplicate_literal_removal,[],[f180]) ).
fof(f180,plain,
! [X0] :
( sP3
| sP3
| ~ big_p(X0) ),
inference(resolution,[],[f177,f49]) ).
fof(f49,plain,
! [X1] :
( ~ big_p(sK6)
| sP3
| ~ big_p(X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f207,plain,
! [X0] :
( sP1
| big_q(X0)
| ~ sP2 ),
inference(resolution,[],[f199,f50]) ).
fof(f199,plain,
( big_q(sK11)
| sP1 ),
inference(duplicate_literal_removal,[],[f197]) ).
fof(f197,plain,
( sP1
| big_q(sK11)
| sP1 ),
inference(resolution,[],[f195,f92]) ).
fof(f216,plain,
! [X0] :
( sP1
| ~ big_q(X0) ),
inference(duplicate_literal_removal,[],[f215]) ).
fof(f215,plain,
! [X0] :
( sP1
| sP1
| ~ big_q(X0) ),
inference(resolution,[],[f210,f57]) ).
fof(f238,plain,
~ sP4,
inference(resolution,[],[f233,f63]) ).
fof(f233,plain,
sP5,
inference(resolution,[],[f232,f186]) ).
fof(f186,plain,
( ~ sP2
| sP5 ),
inference(resolution,[],[f184,f41]) ).
fof(f41,plain,
( ~ sP3
| sP5
| ~ sP2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f232,plain,
sP2,
inference(subsumption_resolution,[],[f231,f218]) ).
fof(f218,plain,
! [X0] :
( big_q(X0)
| sP2 ),
inference(resolution,[],[f217,f104]) ).
fof(f231,plain,
! [X0] :
( sP2
| ~ big_q(X0) ),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f228,plain,
! [X0] :
( sP2
| sP2
| ~ big_q(X0) ),
inference(resolution,[],[f218,f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN036+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:39:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (8450)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (8457)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [4]
% 0.14/0.37 TRYING [5]
% 0.14/0.37 % (8455)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 TRYING [6]
% 0.14/0.37 % (8456)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (8455)First to succeed.
% 0.14/0.37 % (8457)Also succeeded, but the first one will report.
% 0.14/0.37 % (8456)Also succeeded, but the first one will report.
% 0.14/0.37 % (8455)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8450"
% 0.14/0.37 % (8451)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38 % (8455)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (8455)------------------------------
% 0.14/0.38 % (8455)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (8455)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (8455)Memory used [KB]: 763
% 0.14/0.38 % (8455)Time elapsed: 0.005 s
% 0.14/0.38 % (8455)Instructions burned: 7 (million)
% 0.14/0.38 % (8450)Success in time 0.025 s
%------------------------------------------------------------------------------