TSTP Solution File: SWW102+1 by Vampire-SAT---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.9
% Problem : SWW102+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d SAT
% Computer : n016.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 : Mon Jun 24 18:47:54 EDT 2024
% Result : Theorem 1.39s 0.58s
% Output : Refutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 26
% Syntax : Number of formulae : 148 ( 52 unt; 0 def)
% Number of atoms : 286 ( 131 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 250 ( 112 ~; 100 |; 19 &)
% ( 10 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 85 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1822,plain,
$false,
inference(avatar_sat_refutation,[],[f378,f447,f486,f529,f1801,f1815,f1821]) ).
fof(f1821,plain,
( ~ spl8_8
| ~ spl8_23 ),
inference(avatar_contradiction_clause,[],[f1820]) ).
fof(f1820,plain,
( $false
| ~ spl8_8
| ~ spl8_23 ),
inference(subsumption_resolution,[],[f1819,f185]) ).
fof(f185,plain,
true = not1(false1),
inference(definition_unfolding,[],[f113,f112]) ).
fof(f112,plain,
false = false1,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
false = false1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f113,plain,
true = not1(false),
inference(cnf_transformation,[],[f42]) ).
fof(f42,axiom,
true = not1(false),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1819,plain,
( true != not1(false1)
| ~ spl8_8
| ~ spl8_23 ),
inference(forward_demodulation,[],[f1817,f255]) ).
fof(f255,plain,
true = impl(false1,false1),
inference(resolution,[],[f198,f222]) ).
fof(f222,plain,
bool(false1),
inference(equality_resolution,[],[f200]) ).
fof(f200,plain,
! [X0] :
( false1 != X0
| bool(X0) ),
inference(definition_unfolding,[],[f138,f112]) ).
fof(f138,plain,
! [X0] :
( false != X0
| bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( bool(X0)
<=> ( true = X0
| false = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f198,plain,
! [X0] :
( ~ bool(X0)
| true = impl(false1,X0) ),
inference(definition_unfolding,[],[f133,f112]) ).
fof(f133,plain,
! [X0] :
( ~ bool(X0)
| true = impl(false,X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0] :
( true = impl(false,X0)
| ~ bool(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0] :
( bool(X0)
=> true = impl(false,X0) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X3] :
( bool(X3)
=> true = impl(false,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1817,plain,
( not1(false1) != impl(false1,false1)
| ~ spl8_8
| ~ spl8_23 ),
inference(backward_demodulation,[],[f539,f1780]) ).
fof(f1780,plain,
( false1 = sK0
| ~ spl8_23 ),
inference(avatar_component_clause,[],[f1778]) ).
fof(f1778,plain,
( spl8_23
<=> false1 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_23])]) ).
fof(f539,plain,
( not1(sK0) != impl(sK0,false1)
| ~ spl8_8 ),
inference(backward_demodulation,[],[f184,f535]) ).
fof(f535,plain,
( false1 = false2
| ~ spl8_8 ),
inference(forward_demodulation,[],[f533,f263]) ).
fof(f263,plain,
false1 = lazy_impl(true,false1),
inference(resolution,[],[f250,f187]) ).
fof(f187,plain,
d(false1),
inference(definition_unfolding,[],[f116,f112]) ).
fof(f116,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
( d(err)
& d(false)
& d(true) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f250,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(forward_demodulation,[],[f195,f192]) ).
fof(f192,plain,
! [X0] : lazy_and1(true,X0) = lazy_impl(true,X0),
inference(definition_unfolding,[],[f125,f124]) ).
fof(f124,plain,
! [X0] : phi(X0) = lazy_and1(true,X0),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] : phi(X0) = lazy_and1(true,X0),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
! [X3] : phi(X3) = lazy_and1(true,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f125,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3] : phi(X3) = lazy_impl(true,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f195,plain,
! [X0] :
( lazy_and1(true,X0) = X0
| ~ d(X0) ),
inference(definition_unfolding,[],[f127,f124]) ).
fof(f127,plain,
! [X0] :
( phi(X0) = X0
| ~ d(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ( err = phi(X0)
& ~ d(X0) )
| ( phi(X0) = X0
& d(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f533,plain,
( false2 = lazy_impl(true,false1)
| ~ spl8_8 ),
inference(superposition,[],[f532,f192]) ).
fof(f532,plain,
( false2 = lazy_and1(true,false1)
| ~ spl8_8 ),
inference(forward_demodulation,[],[f531,f263]) ).
fof(f531,plain,
( false2 = lazy_and1(true,lazy_impl(true,false1))
| ~ spl8_8 ),
inference(forward_demodulation,[],[f530,f232]) ).
fof(f232,plain,
true = prop(false1),
inference(resolution,[],[f142,f222]) ).
fof(f142,plain,
! [X0] :
( ~ bool(X0)
| true = prop(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( true = prop(X0)
<=> bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f530,plain,
( false2 = lazy_and1(true,lazy_impl(prop(false1),false1))
| ~ spl8_8 ),
inference(forward_demodulation,[],[f220,f373]) ).
fof(f373,plain,
( false1 = sK7
| ~ spl8_8 ),
inference(avatar_component_clause,[],[f371]) ).
fof(f371,plain,
( spl8_8
<=> false1 = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_8])]) ).
fof(f220,plain,
false2 = lazy_and1(true,lazy_impl(prop(sK7),sK7)),
inference(definition_unfolding,[],[f175,f124,f126]) ).
fof(f126,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(rectify,[],[f39]) ).
fof(f39,axiom,
! [X4] : f7(X4) = lazy_impl(prop(X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f175,plain,
false2 = phi(f7(sK7)),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ! [X1] : ~ forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(ennf_transformation,[],[f80]) ).
fof(f80,plain,
? [X0] :
( ~ ? [X1] : forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(rectify,[],[f40]) ).
fof(f40,axiom,
? [X4] :
( ~ ? [X9] : forallprefers(f7(X9),f7(X4))
& false2 = phi(f7(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f184,plain,
not1(sK0) != impl(sK0,false2),
inference(definition_unfolding,[],[f111,f123]) ).
fof(f123,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(rectify,[],[f44]) ).
fof(f44,axiom,
! [X4] : not2(X4) = impl(X4,false2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f111,plain,
not2(sK0) != not1(sK0),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
? [X0] : not2(X0) != not1(X0),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
~ ! [X0] : not2(X0) = not1(X0),
inference(rectify,[],[f46]) ).
fof(f46,negated_conjecture,
~ ! [X4] : not2(X4) = not1(X4),
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
! [X4] : not2(X4) = not1(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1815,plain,
( spl8_23
| spl8_22
| ~ spl8_8 ),
inference(avatar_split_clause,[],[f1811,f371,f1774,f1778]) ).
fof(f1774,plain,
( spl8_22
<=> true = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_22])]) ).
fof(f1811,plain,
( true = sK0
| false1 = sK0
| ~ spl8_8 ),
inference(resolution,[],[f1771,f201]) ).
fof(f201,plain,
! [X0] :
( ~ bool(X0)
| true = X0
| false1 = X0 ),
inference(definition_unfolding,[],[f137,f112]) ).
fof(f137,plain,
! [X0] :
( false = X0
| true = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f1771,plain,
( bool(sK0)
| ~ spl8_8 ),
inference(trivial_inequality_removal,[],[f1745]) ).
fof(f1745,plain,
( true != true
| bool(sK0)
| ~ spl8_8 ),
inference(superposition,[],[f143,f1742]) ).
fof(f1742,plain,
( true = prop(sK0)
| ~ spl8_8 ),
inference(subsumption_resolution,[],[f1735,f274]) ).
fof(f274,plain,
! [X0] :
( not1(X0) = lazy_impl(true,X0)
| true = prop(X0) ),
inference(resolution,[],[f264,f142]) ).
fof(f264,plain,
! [X0] :
( bool(X0)
| not1(X0) = lazy_impl(true,X0) ),
inference(forward_demodulation,[],[f196,f192]) ).
fof(f196,plain,
! [X0] :
( bool(X0)
| not1(X0) = lazy_and1(true,X0) ),
inference(definition_unfolding,[],[f130,f124]) ).
fof(f130,plain,
! [X0] :
( bool(X0)
| phi(X0) = not1(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0] :
( phi(X0) = not1(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ~ bool(X0)
=> phi(X0) = not1(X0) ),
inference(rectify,[],[f41]) ).
fof(f41,axiom,
! [X2] :
( ~ bool(X2)
=> phi(X2) = not1(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1735,plain,
( not1(sK0) != lazy_impl(true,sK0)
| true = prop(sK0)
| ~ spl8_8 ),
inference(superposition,[],[f539,f575]) ).
fof(f575,plain,
! [X0,X1] :
( lazy_impl(true,X0) = impl(X0,X1)
| true = prop(X0) ),
inference(resolution,[],[f317,f142]) ).
fof(f317,plain,
! [X0,X1] :
( bool(X0)
| lazy_impl(true,X0) = impl(X0,X1) ),
inference(forward_demodulation,[],[f209,f192]) ).
fof(f209,plain,
! [X0,X1] :
( bool(X0)
| lazy_and1(true,X0) = impl(X0,X1) ),
inference(definition_unfolding,[],[f153,f124]) ).
fof(f153,plain,
! [X0,X1] :
( bool(X0)
| phi(X0) = impl(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( phi(X0) = impl(X0,X1)
| bool(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( ~ bool(X0)
=> phi(X0) = impl(X0,X1) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2,X3] :
( ~ bool(X2)
=> impl(X2,X3) = phi(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f143,plain,
! [X0] :
( true != prop(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f1801,plain,
( ~ spl8_8
| ~ spl8_22 ),
inference(avatar_contradiction_clause,[],[f1800]) ).
fof(f1800,plain,
( $false
| ~ spl8_8
| ~ spl8_22 ),
inference(subsumption_resolution,[],[f1799,f186]) ).
fof(f186,plain,
false1 = not1(true),
inference(definition_unfolding,[],[f114,f112]) ).
fof(f114,plain,
false = not1(true),
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
false = not1(true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1799,plain,
( false1 != not1(true)
| ~ spl8_8
| ~ spl8_22 ),
inference(forward_demodulation,[],[f1798,f247]) ).
fof(f247,plain,
false1 = impl(true,false1),
inference(resolution,[],[f136,f222]) ).
fof(f136,plain,
! [X0] :
( ~ bool(X0)
| impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0] :
( impl(true,X0) = X0
| ~ bool(X0) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0] :
( bool(X0)
=> impl(true,X0) = X0 ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X3] :
( bool(X3)
=> impl(true,X3) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1798,plain,
( not1(true) != impl(true,false1)
| ~ spl8_8
| ~ spl8_22 ),
inference(backward_demodulation,[],[f539,f1776]) ).
fof(f1776,plain,
( true = sK0
| ~ spl8_22 ),
inference(avatar_component_clause,[],[f1774]) ).
fof(f529,plain,
~ spl8_7,
inference(avatar_contradiction_clause,[],[f528]) ).
fof(f528,plain,
( $false
| ~ spl8_7 ),
inference(subsumption_resolution,[],[f527,f226]) ).
fof(f226,plain,
forallprefers(false1,true),
inference(equality_resolution,[],[f225]) ).
fof(f225,plain,
! [X1] :
( true != X1
| forallprefers(false1,X1) ),
inference(equality_resolution,[],[f214]) ).
fof(f214,plain,
! [X0,X1] :
( false1 != X0
| true != X1
| forallprefers(X0,X1) ),
inference(definition_unfolding,[],[f160,f112]) ).
fof(f160,plain,
! [X0,X1] :
( false != X0
| true != X1
| forallprefers(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| ( ( true != X1
| false != X0 )
& ( ~ bool(X1)
| bool(X0)
| ~ d(X1)
| ~ d(X0) )
& ( ~ d(X1)
| d(X0) ) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1] :
( ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) )
=> forallprefers(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f527,plain,
( ~ forallprefers(false1,true)
| ~ spl8_7 ),
inference(forward_demodulation,[],[f518,f263]) ).
fof(f518,plain,
( ~ forallprefers(lazy_impl(true,false1),true)
| ~ spl8_7 ),
inference(superposition,[],[f345,f232]) ).
fof(f345,plain,
( ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),true)
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f344]) ).
fof(f344,plain,
( spl8_7
<=> ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),true) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_7])]) ).
fof(f486,plain,
( spl8_1
| spl8_7 ),
inference(avatar_split_clause,[],[f485,f344,f288]) ).
fof(f288,plain,
( spl8_1
<=> true = prop(sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f485,plain,
! [X0] :
( ~ forallprefers(lazy_impl(prop(X0),X0),true)
| true = prop(sK7) ),
inference(forward_demodulation,[],[f468,f191]) ).
fof(f191,plain,
! [X0] : true = lazy_impl(false1,X0),
inference(definition_unfolding,[],[f122,f112]) ).
fof(f122,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0] : true = lazy_impl(false,X0),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3] : true = lazy_impl(false,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f468,plain,
! [X0] :
( ~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(false1,sK7))
| true = prop(sK7) ),
inference(superposition,[],[f219,f239]) ).
fof(f239,plain,
! [X0] :
( prop(X0) = false1
| true = prop(X0) ),
inference(resolution,[],[f203,f142]) ).
fof(f203,plain,
! [X0] :
( bool(X0)
| prop(X0) = false1 ),
inference(definition_unfolding,[],[f140,f112]) ).
fof(f140,plain,
! [X0] :
( bool(X0)
| false = prop(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( false = prop(X0)
<=> ~ bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f219,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK7),sK7)),
inference(definition_unfolding,[],[f176,f126,f126]) ).
fof(f176,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK7)),
inference(cnf_transformation,[],[f110]) ).
fof(f447,plain,
~ spl8_9,
inference(avatar_contradiction_clause,[],[f446]) ).
fof(f446,plain,
( $false
| ~ spl8_9 ),
inference(subsumption_resolution,[],[f445,f226]) ).
fof(f445,plain,
( ~ forallprefers(false1,true)
| ~ spl8_9 ),
inference(forward_demodulation,[],[f444,f261]) ).
fof(f261,plain,
true = lazy_impl(true,true),
inference(resolution,[],[f250,f115]) ).
fof(f115,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f444,plain,
( ~ forallprefers(false1,lazy_impl(true,true))
| ~ spl8_9 ),
inference(forward_demodulation,[],[f443,f231]) ).
fof(f231,plain,
true = prop(true),
inference(resolution,[],[f142,f221]) ).
fof(f221,plain,
bool(true),
inference(equality_resolution,[],[f139]) ).
fof(f139,plain,
! [X0] :
( true != X0
| bool(X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f443,plain,
( ~ forallprefers(false1,lazy_impl(prop(true),true))
| ~ spl8_9 ),
inference(forward_demodulation,[],[f332,f377]) ).
fof(f377,plain,
( true = sK7
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f375,plain,
( spl8_9
<=> true = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_9])]) ).
fof(f332,plain,
~ forallprefers(false1,lazy_impl(prop(sK7),sK7)),
inference(forward_demodulation,[],[f320,f263]) ).
fof(f320,plain,
~ forallprefers(lazy_impl(true,false1),lazy_impl(prop(sK7),sK7)),
inference(superposition,[],[f219,f232]) ).
fof(f378,plain,
( spl8_8
| spl8_9
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f369,f288,f375,f371]) ).
fof(f369,plain,
( true = sK7
| false1 = sK7
| ~ spl8_1 ),
inference(resolution,[],[f361,f201]) ).
fof(f361,plain,
( bool(sK7)
| ~ spl8_1 ),
inference(trivial_inequality_removal,[],[f360]) ).
fof(f360,plain,
( true != true
| bool(sK7)
| ~ spl8_1 ),
inference(superposition,[],[f143,f290]) ).
fof(f290,plain,
( true = prop(sK7)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f288]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : SWW102+1 : TPTP v8.2.0. Released v5.2.0.
% 0.05/0.14 % Command : run_vampire %s %d SAT
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Jun 19 07:02:39 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.21/0.38 Running first-order model finding
% 0.21/0.38 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20066)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20070)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20069)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20071)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20072)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20068)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.21/0.44 % (20065)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (20067)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.23/0.45 Detected minimum model sizes of [3]
% 0.23/0.45 Detected maximum model sizes of [max]
% 0.23/0.45 Detected minimum model sizes of [3]
% 0.23/0.45 Detected maximum model sizes of [max]
% 0.23/0.45 Detected minimum model sizes of [3]
% 0.23/0.45 Detected maximum model sizes of [max]
% 0.23/0.45 TRYING [3]
% 0.23/0.47 TRYING [4]
% 0.23/0.50 % (20070)Instruction limit reached!
% 0.23/0.50 % (20070)------------------------------
% 0.23/0.50 % (20070)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.50 % (20070)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.50 % (20070)Termination reason: Time limit
% 0.23/0.50 % (20070)Termination phase: Saturation
% 0.23/0.50
% 0.23/0.50 % (20070)Memory used [KB]: 1622
% 0.23/0.50 % (20070)Time elapsed: 0.062 s
% 0.23/0.50 % (20070)Instructions burned: 105 (million)
% 0.23/0.51 % (20072)Instruction limit reached!
% 0.23/0.51 % (20072)------------------------------
% 0.23/0.51 % (20072)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.51 % (20072)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.51 % (20072)Termination reason: Time limit
% 0.23/0.51 % (20072)Termination phase: Saturation
% 0.23/0.51
% 0.23/0.51 % (20072)Memory used [KB]: 2339
% 0.23/0.51 % (20072)Time elapsed: 0.072 s
% 0.23/0.51 % (20072)Instructions burned: 115 (million)
% 0.23/0.52 TRYING [10]
% 0.23/0.54 % (20071)Instruction limit reached!
% 0.23/0.54 % (20071)------------------------------
% 0.23/0.54 % (20071)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.54 % (20071)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.54 % (20071)Termination reason: Time limit
% 0.23/0.54 % (20071)Termination phase: Saturation
% 0.23/0.54
% 0.23/0.54 % (20071)Memory used [KB]: 2320
% 0.23/0.54 % (20071)Time elapsed: 0.096 s
% 0.23/0.54 % (20071)Instructions burned: 146 (million)
% 0.23/0.54 TRYING [5]
% 1.26/0.55 % (20065)Running in auto input_syntax mode. Trying TPTP
% 1.26/0.55 % (20099)dis+11_1:3_bsr=unit_only:sil=2000:rp=on:newcnf=on:i=404:kws=precedence:lsd=100_0 on theBenchmark for (2998ds/404Mi)
% 1.26/0.56 % (20065)Running in auto input_syntax mode. Trying TPTP
% 1.26/0.56 % (20104)ott-21_1:1_sil=4000:sp=const_frequency:i=175:fsr=off:fs=off:av=off_0 on theBenchmark for (2998ds/175Mi)
% 1.39/0.57 % (20065)Running in auto input_syntax mode. Trying TPTP
% 1.39/0.57 % (20115)ott+33_1:1_to=lpo:sil=8000:sp=weighted_frequency:rp=on:i=270:nm=3:fsr=off:sac=on_0 on theBenchmark for (2998ds/270Mi)
% 1.39/0.58 % (20099)First to succeed.
% 1.39/0.58 % (20099)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20065"
% 1.39/0.58 % (20065)Running in auto input_syntax mode. Trying TPTP
% 1.39/0.58 % (20099)Refutation found. Thanks to Tanya!
% 1.39/0.58 % SZS status Theorem for theBenchmark
% 1.39/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.39/0.58 % (20099)------------------------------
% 1.39/0.58 % (20099)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.39/0.58 % (20099)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.39/0.58 % (20099)Termination reason: Refutation
% 1.39/0.58
% 1.39/0.58 % (20099)Memory used [KB]: 1442
% 1.39/0.58 % (20099)Time elapsed: 0.028 s
% 1.39/0.58 % (20099)Instructions burned: 77 (million)
% 1.39/0.58 % (20099)------------------------------
% 1.39/0.58 % (20099)------------------------------
% 1.39/0.58 % (20065)Success in time 0.189 s
%------------------------------------------------------------------------------