TSTP Solution File: SYN392+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n022.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 : Wed Aug 31 19:26:28 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 119 ( 45 ~; 50 |; 15 &)
% ( 7 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f34]) ).
fof(f34,plain,
~ p1,
inference(subsumption_resolution,[],[f22,f20]) ).
fof(f20,plain,
( ~ sP0
| ~ p1 ),
inference(subsumption_resolution,[],[f18,f9]) ).
fof(f9,plain,
( ~ sP0
| p2
| ~ p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ( sP0
| ( p2
& ~ p1 )
| ( p1
& ~ p2 ) )
& ( ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) )
| ~ sP0 ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
( ( sP0
| ( p2
& ~ p1 )
| ( p1
& ~ p2 ) )
& ( ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( sP0
<=> ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f18,plain,
( ~ sP0
| ~ p2
| ~ p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ( ~ sP0
| ( ( ~ p1
| ~ p2 )
& ( p1
| p2 ) ) )
& ( sP0
| ( ( p2
| ~ p1 )
& ( p1
| ~ p2 ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
( ( p2
<=> p1 )
<~> sP0 ),
inference(definition_folding,[],[f3,f4]) ).
fof(f3,plain,
( ( p2
<=> p1 )
<~> ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) )
<=> ( p2
<=> p1 ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ( ~ p2
| p1 )
& ( ~ p1
| p2 ) )
<=> ( p2
<=> p1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).
fof(f22,plain,
( sP0
| ~ p1 ),
inference(subsumption_resolution,[],[f16,f11]) ).
fof(f11,plain,
( sP0
| ~ p1
| ~ p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
( ~ p1
| p2
| sP0 ),
inference(cnf_transformation,[],[f8]) ).
fof(f36,plain,
p1,
inference(subsumption_resolution,[],[f33,f35]) ).
fof(f35,plain,
p2,
inference(subsumption_resolution,[],[f25,f34]) ).
fof(f25,plain,
( p1
| p2 ),
inference(duplicate_literal_removal,[],[f23]) ).
fof(f23,plain,
( p1
| p2
| p2 ),
inference(resolution,[],[f19,f14]) ).
fof(f14,plain,
( sP0
| p1
| p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
( ~ sP0
| p2 ),
inference(subsumption_resolution,[],[f17,f9]) ).
fof(f17,plain,
( ~ sP0
| p2
| p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f33,plain,
( ~ p2
| p1 ),
inference(duplicate_literal_removal,[],[f31]) ).
fof(f31,plain,
( p1
| ~ p2
| ~ p2 ),
inference(resolution,[],[f21,f10]) ).
fof(f10,plain,
( ~ sP0
| ~ p2
| p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
( sP0
| ~ p2 ),
inference(subsumption_resolution,[],[f15,f11]) ).
fof(f15,plain,
( p1
| ~ p2
| sP0 ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 21:52:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (13973)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50 % (13977)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.50 % (13992)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.50 % (13977)First to succeed.
% 0.20/0.51 % (13984)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (13977)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (13977)------------------------------
% 0.20/0.51 % (13977)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (13977)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (13977)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (13977)Memory used [KB]: 1407
% 0.20/0.51 % (13977)Time elapsed: 0.093 s
% 0.20/0.51 % (13977)Instructions burned: 1 (million)
% 0.20/0.51 % (13977)------------------------------
% 0.20/0.51 % (13977)------------------------------
% 0.20/0.51 % (13971)Success in time 0.159 s
%------------------------------------------------------------------------------