%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:39:33 PM UTC 2026
% Result : Theorem 0.18s 0.31s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 29
% Syntax : Number of formulae : 182 ( 56 unt; 9 def)
% Number of atoms : 396 ( 137 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 397 ( 183 ~; 176 |; 20 &)
% ( 13 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 69 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( bool(X0)
<=> ( X0 = false
| X0 = true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(f2,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',distinct_false_true_err) ).
fof(f3,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
fof(f6,axiom,
! [X0] :
( ( d(X0)
& phi(X0) = X0 )
| ( ~ d(X0)
& phi(X0) = err ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_phi) ).
fof(f7,axiom,
! [X0] :
( prop(X0) = true
<=> bool(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(f8,axiom,
! [X0] :
( prop(X0) = false
<=> ~ bool(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(f9,axiom,
! [X0,X1] :
( ~ bool(X0)
=> impl(X0,X1) = phi(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom1) ).
fof(f11,axiom,
! [X0] :
( bool(X0)
=> impl(false,X0) = true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom3) ).
fof(f12,axiom,
! [X0] :
( bool(X0)
=> impl(true,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom4) ).
fof(f14,axiom,
! [X0] : lazy_impl(false,X0) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
fof(f15,axiom,
! [X0] : lazy_impl(true,X0) = phi(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
fof(f38,axiom,
false1 = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false1) ).
fof(f39,axiom,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_f7) ).
fof(f40,axiom,
? [X0] :
( false2 = phi(f7(X0))
& ~ ? [X1] : forallprefers(f7(X1),f7(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false2) ).
fof(f41,axiom,
! [X0] :
( ~ bool(X0)
=> not1(X0) = phi(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
fof(f42,axiom,
not1(false) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom2) ).
fof(f43,axiom,
not1(true) = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom3) ).
fof(f44,axiom,
! [X0] : not2(X0) = impl(X0,false2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_not2) ).
fof(f45,conjecture,
! [X0] : not1(X0) = not2(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_not2) ).
fof(f46,negated_conjecture,
~ ! [X0] : not1(X0) = not2(X0),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f48,plain,
! [X0,X1] :
( ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true ) )
=> forallprefers(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f49,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| ( ( d(X0)
| ~ d(X1) )
& ( ~ d(X0)
| ~ d(X1)
| bool(X0)
| ~ bool(X1) )
& ( false != X0
| true != X1 ) ) ),
inference(ennf_transformation,[],[f48]) ).
fof(f51,plain,
! [X0,X1] :
( impl(X0,X1) = phi(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f54,plain,
! [X0] :
( impl(false,X0) = true
| ~ bool(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f55,plain,
! [X0] :
( impl(true,X0) = X0
| ~ bool(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f74,plain,
? [X0] :
( false2 = phi(f7(X0))
& ! [X1] : ~ forallprefers(f7(X1),f7(X0)) ),
inference(ennf_transformation,[],[f40]) ).
fof(f75,plain,
! [X0] :
( not1(X0) = phi(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f76,plain,
? [X0] : not1(X0) != not2(X0),
inference(ennf_transformation,[],[f46]) ).
fof(f77,plain,
! [X0] :
( true = X0
| false = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f78,plain,
! [X0] :
( true != X0
| bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f79,plain,
! [X0] :
( false != X0
| bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f82,plain,
false != true,
inference(cnf_transformation,[],[f2]) ).
fof(f84,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f85,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f86,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| d(X0)
| ~ d(X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f88,plain,
! [X0,X1] :
( true != X1
| false != X0
| forallprefers(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f92,plain,
! [X0] :
( ~ d(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f95,plain,
! [X0] :
( ~ bool(X0)
| true = prop(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f97,plain,
! [X0] :
( bool(X0)
| false = prop(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f99,plain,
! [X0,X1] :
( bool(X0)
| phi(X0) = impl(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f101,plain,
! [X0] :
( ~ bool(X0)
| true = impl(false,X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f102,plain,
! [X0] :
( ~ bool(X0)
| impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f55]) ).
fof(f104,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f105,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f134,plain,
false = false1,
inference(cnf_transformation,[],[f38]) ).
fof(f135,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(cnf_transformation,[],[f39]) ).
fof(f136,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK6)),
inference(cnf_transformation,[],[f74]) ).
fof(f137,plain,
false2 = phi(f7(sK6)),
inference(cnf_transformation,[],[f74]) ).
fof(f138,plain,
! [X0] :
( bool(X0)
| phi(X0) = not1(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f139,plain,
true = not1(false),
inference(cnf_transformation,[],[f42]) ).
fof(f140,plain,
false = not1(true),
inference(cnf_transformation,[],[f43]) ).
fof(f141,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(cnf_transformation,[],[f44]) ).
fof(f142,plain,
not1(sK7) != not2(sK7),
inference(cnf_transformation,[],[f76]) ).
fof(f150,plain,
! [X0] :
( false1 != X0
| bool(X0) ),
inference(definition_unfolding,[],[f79,f134]) ).
fof(f151,plain,
! [X0] :
( ~ bool(X0)
| false1 = X0
| true = X0 ),
inference(definition_unfolding,[],[f77,f134]) ).
fof(f152,plain,
true != false1,
inference(definition_unfolding,[],[f82,f134]) ).
fof(f154,plain,
d(false1),
inference(definition_unfolding,[],[f84,f134]) ).
fof(f155,plain,
! [X0,X1] :
( true != X1
| false1 != X0
| forallprefers(X0,X1) ),
inference(definition_unfolding,[],[f88,f134]) ).
fof(f159,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f92,f105]) ).
fof(f161,plain,
! [X0] :
( bool(X0)
| prop(X0) = false1 ),
inference(definition_unfolding,[],[f97,f134]) ).
fof(f162,plain,
! [X0,X1] :
( bool(X0)
| impl(X0,X1) = lazy_impl(true,X0) ),
inference(definition_unfolding,[],[f99,f105]) ).
fof(f164,plain,
! [X0] :
( ~ bool(X0)
| true = impl(false1,X0) ),
inference(definition_unfolding,[],[f101,f134]) ).
fof(f166,plain,
! [X0] : true = lazy_impl(false1,X0),
inference(definition_unfolding,[],[f104,f134]) ).
fof(f181,plain,
false2 = lazy_impl(true,lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f137,f105,f135]) ).
fof(f182,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f136,f135,f135]) ).
fof(f183,plain,
! [X0] :
( bool(X0)
| lazy_impl(true,X0) = not1(X0) ),
inference(definition_unfolding,[],[f138,f105]) ).
fof(f184,plain,
true = not1(false1),
inference(definition_unfolding,[],[f139,f134]) ).
fof(f185,plain,
false1 = not1(true),
inference(definition_unfolding,[],[f140,f134]) ).
fof(f186,plain,
not1(sK7) != impl(sK7,false2),
inference(definition_unfolding,[],[f142,f141]) ).
fof(f187,plain,
bool(false1),
inference(equality_resolution,[],[f150]) ).
fof(f188,plain,
bool(true),
inference(equality_resolution,[],[f78]) ).
fof(f189,plain,
! [X0] :
( false1 != X0
| forallprefers(X0,true) ),
inference(equality_resolution,[],[f155]) ).
fof(f190,plain,
forallprefers(false1,true),
inference(equality_resolution,[],[f189]) ).
fof(f195,plain,
true = prop(false1),
inference(resolution,[],[f95,f187]) ).
fof(f196,plain,
true = prop(true),
inference(resolution,[],[f95,f188]) ).
fof(f204,plain,
! [X0] :
( prop(X0) = false1
| true = prop(X0) ),
inference(resolution,[],[f161,f95]) ).
fof(f205,plain,
false1 = impl(true,false1),
inference(resolution,[],[f102,f187]) ).
fof(f218,plain,
true = lazy_impl(true,true),
inference(resolution,[],[f159,f85]) ).
fof(f220,plain,
false1 = lazy_impl(true,false1),
inference(resolution,[],[f159,f154]) ).
fof(f221,plain,
true = impl(false1,false1),
inference(resolution,[],[f164,f187]) ).
fof(f236,plain,
! [X0] :
( prop(X0) = false1
| true = X0
| false1 = X0 ),
inference(resolution,[],[f151,f161]) ).
fof(f238,plain,
! [X0] :
( lazy_impl(true,X0) = not1(X0)
| true = prop(X0) ),
inference(resolution,[],[f183,f95]) ).
fof(f247,plain,
! [X0,X1] :
( impl(X0,X1) = lazy_impl(true,X0)
| true = prop(X0) ),
inference(resolution,[],[f162,f95]) ).
fof(f296,definition,
( spl8_1
<=> true = prop(sK6) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f297,plain,
( true != prop(sK6)
| spl8_1 ),
inference(avatar_component_clause,[],[f296]) ).
fof(f298,plain,
( true = prop(sK6)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f296]) ).
fof(f314,plain,
! [X0] :
( d(lazy_impl(prop(X0),X0))
| ~ d(lazy_impl(prop(sK6),sK6)) ),
inference(resolution,[],[f182,f86]) ).
fof(f315,plain,
~ forallprefers(lazy_impl(true,false1),lazy_impl(prop(sK6),sK6)),
inference(superposition,[],[f182,f195]) ).
fof(f322,plain,
~ forallprefers(false1,lazy_impl(prop(sK6),sK6)),
inference(forward_demodulation,[],[f315,f220]) ).
fof(f324,definition,
( spl8_3
<=> d(lazy_impl(prop(sK6),sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f325,plain,
( d(lazy_impl(prop(sK6),sK6))
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f324]) ).
fof(f326,plain,
( ~ d(lazy_impl(prop(sK6),sK6))
| spl8_3 ),
inference(avatar_component_clause,[],[f324]) ).
fof(f328,definition,
( spl8_4
<=> ! [X0] : d(lazy_impl(prop(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
fof(f329,plain,
( ! [X0] : d(lazy_impl(prop(X0),X0))
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f328]) ).
fof(f330,plain,
( ~ spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f314,f328,f324]) ).
fof(f352,plain,
( ~ d(lazy_impl(true,sK6))
| ~ spl8_1
| spl8_3 ),
inference(superposition,[],[f326,f298]) ).
fof(f389,definition,
( spl8_9
<=> false2 = lazy_impl(true,sK6) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
fof(f390,plain,
( false2 != lazy_impl(true,sK6)
| spl8_9 ),
inference(avatar_component_clause,[],[f389]) ).
fof(f391,plain,
( false2 = lazy_impl(true,sK6)
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f389]) ).
fof(f512,definition,
( spl8_13
<=> bool(sK6) ),
introduced(definition,[new_symbols(definition,[spl8_13])],[avatar_definition]) ).
fof(f513,plain,
( bool(sK6)
| ~ spl8_13 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f514,plain,
( ~ bool(sK6)
| spl8_13 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f608,plain,
( false1 = sK6
| true = sK6
| ~ spl8_13 ),
inference(resolution,[],[f513,f151]) ).
fof(f617,definition,
( spl8_16
<=> true = sK6 ),
introduced(definition,[new_symbols(definition,[spl8_16])],[avatar_definition]) ).
fof(f619,plain,
( true = sK6
| ~ spl8_16 ),
inference(avatar_component_clause,[],[f617]) ).
fof(f621,definition,
( spl8_17
<=> false1 = sK6 ),
introduced(definition,[new_symbols(definition,[spl8_17])],[avatar_definition]) ).
fof(f623,plain,
( false1 = sK6
| ~ spl8_17 ),
inference(avatar_component_clause,[],[f621]) ).
fof(f624,plain,
( spl8_16
| spl8_17
| ~ spl8_13 ),
inference(avatar_split_clause,[],[f608,f512,f621,f617]) ).
fof(f660,plain,
( false1 = prop(sK6)
| spl8_13 ),
inference(resolution,[],[f514,f161]) ).
fof(f708,plain,
( lazy_impl(prop(sK6),sK6) = lazy_impl(true,lazy_impl(prop(sK6),sK6))
| ~ spl8_3 ),
inference(resolution,[],[f325,f159]) ).
fof(f711,plain,
( false2 = lazy_impl(prop(sK6),sK6)
| ~ spl8_3 ),
inference(forward_demodulation,[],[f708,f181]) ).
fof(f715,plain,
( ! [X0] : lazy_impl(prop(X0),X0) = lazy_impl(true,lazy_impl(prop(X0),X0))
| ~ spl8_4 ),
inference(resolution,[],[f329,f159]) ).
fof(f824,plain,
( ~ forallprefers(false1,lazy_impl(false1,sK6))
| spl8_13 ),
inference(superposition,[],[f322,f660]) ).
fof(f825,plain,
( ~ forallprefers(false1,lazy_impl(false1,sK6))
| true = prop(sK6) ),
inference(superposition,[],[f322,f204]) ).
fof(f826,plain,
( ~ forallprefers(false1,lazy_impl(false1,sK6))
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f825,f297]) ).
fof(f827,plain,
( ~ forallprefers(false1,true)
| spl8_13 ),
inference(forward_demodulation,[],[f824,f166]) ).
fof(f828,plain,
( ~ forallprefers(false1,true)
| spl8_1 ),
inference(forward_demodulation,[],[f826,f166]) ).
fof(f829,plain,
( $false
| spl8_13 ),
inference(forward_subsumption_resolution,[],[f827,f190]) ).
fof(f830,plain,
spl8_13,
inference(avatar_contradiction_clause,[],[f829]) ).
fof(f831,plain,
( $false
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f828,f190]) ).
fof(f832,plain,
spl8_1,
inference(avatar_contradiction_clause,[],[f831]) ).
fof(f912,plain,
( ~ forallprefers(false1,lazy_impl(prop(true),true))
| ~ spl8_16 ),
inference(superposition,[],[f322,f619]) ).
fof(f916,plain,
( ~ forallprefers(false1,lazy_impl(true,true))
| ~ spl8_16 ),
inference(forward_demodulation,[],[f912,f196]) ).
fof(f919,plain,
( ~ forallprefers(false1,true)
| ~ spl8_16 ),
inference(forward_demodulation,[],[f916,f218]) ).
fof(f922,plain,
( $false
| ~ spl8_16 ),
inference(forward_subsumption_resolution,[],[f919,f190]) ).
fof(f923,plain,
~ spl8_16,
inference(avatar_contradiction_clause,[],[f922]) ).
fof(f928,plain,
( false2 = lazy_impl(prop(false1),false1)
| ~ spl8_3
| ~ spl8_17 ),
inference(forward_demodulation,[],[f711,f623]) ).
fof(f946,plain,
( false2 = lazy_impl(true,false1)
| ~ spl8_3
| ~ spl8_17 ),
inference(forward_demodulation,[],[f928,f195]) ).
fof(f954,plain,
( false1 = false2
| ~ spl8_3
| ~ spl8_17 ),
inference(forward_demodulation,[],[f946,f220]) ).
fof(f989,plain,
( false2 = lazy_impl(true,false1)
| ~ spl8_9
| ~ spl8_17 ),
inference(forward_demodulation,[],[f391,f623]) ).
fof(f995,plain,
( false1 = false2
| ~ spl8_9
| ~ spl8_17 ),
inference(forward_demodulation,[],[f989,f220]) ).
fof(f1016,plain,
( not1(sK7) != impl(sK7,false1)
| ~ spl8_3
| ~ spl8_17 ),
inference(superposition,[],[f186,f954]) ).
fof(f1017,plain,
( false2 = lazy_impl(true,lazy_impl(prop(false1),false1))
| ~ spl8_17 ),
inference(superposition,[],[f181,f623]) ).
fof(f1026,plain,
( false2 = lazy_impl(prop(false1),false1)
| ~ spl8_4
| ~ spl8_17 ),
inference(forward_demodulation,[],[f1017,f715]) ).
fof(f1029,plain,
( false2 = lazy_impl(true,false1)
| ~ spl8_4
| ~ spl8_17 ),
inference(forward_demodulation,[],[f1026,f195]) ).
fof(f1030,plain,
( false1 = false2
| ~ spl8_4
| ~ spl8_17 ),
inference(forward_demodulation,[],[f1029,f220]) ).
fof(f1480,plain,
( not1(sK7) != lazy_impl(true,sK7)
| true = prop(sK7)
| ~ spl8_3
| ~ spl8_17 ),
inference(superposition,[],[f1016,f247]) ).
fof(f1481,plain,
( true = prop(sK7)
| ~ spl8_3
| ~ spl8_17 ),
inference(forward_subsumption_resolution,[],[f1480,f238]) ).
fof(f1483,plain,
( true = false1
| true = sK7
| false1 = sK7
| ~ spl8_3
| ~ spl8_17 ),
inference(superposition,[],[f1481,f236]) ).
fof(f1504,definition,
( spl8_22
<=> false1 = sK7 ),
introduced(definition,[new_symbols(definition,[spl8_22])],[avatar_definition]) ).
fof(f1506,plain,
( false1 = sK7
| ~ spl8_22 ),
inference(avatar_component_clause,[],[f1504]) ).
fof(f1508,definition,
( spl8_23
<=> true = sK7 ),
introduced(definition,[new_symbols(definition,[spl8_23])],[avatar_definition]) ).
fof(f1510,plain,
( true = sK7
| ~ spl8_23 ),
inference(avatar_component_clause,[],[f1508]) ).
fof(f1514,plain,
( true = sK7
| false1 = sK7
| ~ spl8_3
| ~ spl8_17 ),
inference(forward_subsumption_resolution,[],[f1483,f152]) ).
fof(f1517,plain,
( spl8_22
| spl8_23
| ~ spl8_3
| ~ spl8_17 ),
inference(avatar_split_clause,[],[f1514,f621,f324,f1508,f1504]) ).
fof(f1627,plain,
( not1(true) != impl(true,false2)
| ~ spl8_23 ),
inference(superposition,[],[f186,f1510]) ).
fof(f1628,plain,
( not1(true) != impl(true,false1)
| ~ spl8_3
| ~ spl8_17
| ~ spl8_23 ),
inference(forward_demodulation,[],[f1627,f954]) ).
fof(f1630,plain,
( false1 != not1(true)
| ~ spl8_3
| ~ spl8_17
| ~ spl8_23 ),
inference(forward_demodulation,[],[f1628,f205]) ).
fof(f1633,plain,
( $false
| ~ spl8_3
| ~ spl8_17
| ~ spl8_23 ),
inference(forward_subsumption_resolution,[],[f1630,f185]) ).
fof(f1634,plain,
( ~ spl8_3
| ~ spl8_17
| ~ spl8_23 ),
inference(avatar_contradiction_clause,[],[f1633]) ).
fof(f1638,plain,
( ~ d(lazy_impl(true,false1))
| ~ spl8_1
| spl8_3
| ~ spl8_17 ),
inference(forward_demodulation,[],[f352,f623]) ).
fof(f1645,plain,
( ~ d(false1)
| ~ spl8_1
| spl8_3
| ~ spl8_17 ),
inference(forward_demodulation,[],[f1638,f220]) ).
fof(f1652,plain,
( $false
| ~ spl8_1
| spl8_3
| ~ spl8_17 ),
inference(forward_subsumption_resolution,[],[f1645,f154]) ).
fof(f1653,plain,
( ~ spl8_1
| spl8_3
| ~ spl8_17 ),
inference(avatar_contradiction_clause,[],[f1652]) ).
fof(f1674,plain,
( not1(sK7) != impl(sK7,false1)
| ~ spl8_9
| ~ spl8_17 ),
inference(superposition,[],[f186,f995]) ).
fof(f1675,plain,
( not1(false1) != impl(false1,false1)
| ~ spl8_9
| ~ spl8_17
| ~ spl8_22 ),
inference(forward_demodulation,[],[f1674,f1506]) ).
fof(f1680,plain,
( true != not1(false1)
| ~ spl8_9
| ~ spl8_17
| ~ spl8_22 ),
inference(forward_demodulation,[],[f1675,f221]) ).
fof(f1681,plain,
( $false
| ~ spl8_9
| ~ spl8_17
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f1680,f184]) ).
fof(f1682,plain,
( ~ spl8_9
| ~ spl8_17
| ~ spl8_22 ),
inference(avatar_contradiction_clause,[],[f1681]) ).
fof(f1683,plain,
( false2 != lazy_impl(true,false1)
| spl8_9
| ~ spl8_17 ),
inference(forward_demodulation,[],[f390,f623]) ).
fof(f1684,plain,
( false1 != false2
| spl8_9
| ~ spl8_17 ),
inference(forward_demodulation,[],[f1683,f220]) ).
fof(f1685,plain,
( $false
| ~ spl8_4
| spl8_9
| ~ spl8_17 ),
inference(forward_subsumption_resolution,[],[f1684,f1030]) ).
fof(f1686,plain,
( ~ spl8_4
| spl8_9
| ~ spl8_17 ),
inference(avatar_contradiction_clause,[],[f1685]) ).
cnf(s2,plain,
( ~ spl8_3
| spl8_4 ),
inference(sat_conversion,[],[f330]) ).
cnf(s19,plain,
( ~ spl8_13
| spl8_16
| spl8_17 ),
inference(sat_conversion,[],[f624]) ).
cnf(s25,plain,
spl8_13,
inference(sat_conversion,[],[f830]) ).
cnf(s26,plain,
spl8_1,
inference(sat_conversion,[],[f832]) ).
cnf(s27,plain,
~ spl8_16,
inference(sat_conversion,[],[f923]) ).
cnf(s38,plain,
( ~ spl8_3
| ~ spl8_17
| spl8_22
| spl8_23 ),
inference(sat_conversion,[],[f1517]) ).
cnf(s40,plain,
( ~ spl8_3
| ~ spl8_17
| ~ spl8_23 ),
inference(sat_conversion,[],[f1634]) ).
cnf(s44,plain,
( ~ spl8_1
| spl8_3
| ~ spl8_17 ),
inference(sat_conversion,[],[f1653]) ).
cnf(s47,plain,
( ~ spl8_9
| ~ spl8_17
| ~ spl8_22 ),
inference(sat_conversion,[],[f1682]) ).
cnf(s48,plain,
( ~ spl8_4
| spl8_9
| ~ spl8_17 ),
inference(sat_conversion,[],[f1686]) ).
cnf(s49,plain,
spl8_17,
inference(rat,[],[s19,s27,s25]) ).
cnf(s51,plain,
spl8_3,
inference(rat,[],[s44,s26,s49]) ).
cnf(s52,plain,
~ spl8_23,
inference(rat,[],[s40,s49,s51]) ).
cnf(s53,plain,
spl8_22,
inference(rat,[],[s38,s52,s49,s51]) ).
cnf(s54,plain,
~ spl8_9,
inference(rat,[],[s47,s49,s53]) ).
cnf(s55,plain,
~ spl8_4,
inference(rat,[],[s48,s49,s54]) ).
cnf(s59,plain,
$false,
inference(rat,[],[s2,s55,s51]) ).
fof(f1687,plain,
$false,
inference(avatar_sat_refutation,[],[s59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n020.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 13:12:50 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.31 % (152750)Will run a generic schedule for satisfiability detection.
% 0.18/0.31 % (152757)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=459133244:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.31 % (152756)% WARNING: option uhcvi not known.
% 0.18/0.31 % (152755)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=330826677_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.31 % (152756)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1791222215:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.31 % (152758)dis+10_1_sil=32000:sp=arity:random_seed=501281949:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.31 % (152759)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=926457659:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.31 % (152760)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4164871064:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.31 % (152761)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=945397154:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.31 % Detected minimum model sizes of [3]
% 0.18/0.31 % Detected maximum model sizes of [max]
% 0.18/0.31 % TRYING [3]
% 0.18/0.31 % TRYING [4]
% 0.18/0.31 % (152759) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-152750-152759"...
% 0.18/0.31 % (152759)...printing done.
% 0.18/0.31 % (152759)Refutation found. Thanks to Tanya!
% 0.18/0.31 % SZS status Theorem for theBenchmark
% 0.18/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.31 % (152759)------------------------------
% 0.18/0.31 % (152759)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31 % (152759)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31 % (152759)CaDiCaL version: 2.1.3
% 0.18/0.31 % (152759)Termination reason: Refutation
% 0.18/0.31 % (152759)Time elapsed: 0.038 s
% 0.18/0.31 % (152759)Peak memory usage: 13 MB
% 0.18/0.31 % (152759)Instructions burned: 65 (million)
% 0.18/0.31 % (152750)Success in time 0.082 s
% 0.18/0.31 % Vampire exiting
%------------------------------------------------------------------------------