TSTP Solution File: SYN354+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN354+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n024.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 Apr 30 18:03:01 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 180 ( 0 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 238 ( 80 ~; 82 |; 54 &)
% ( 6 <=>; 14 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 28 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,plain,
$false,
inference(subsumption_resolution,[],[f29,f10]) ).
fof(f10,plain,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X2,X3] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) )
=> ( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_20_1) ).
fof(f29,plain,
~ big_f(sK0,sK1),
inference(subsumption_resolution,[],[f27,f25]) ).
fof(f25,plain,
big_f(sK1,sK1),
inference(subsumption_resolution,[],[f24,f19]) ).
fof(f19,plain,
( big_g(sK1,sK2(sK0,sK1))
| big_f(sK1,sK1) ),
inference(duplicate_literal_removal,[],[f18]) ).
fof(f18,plain,
( big_f(sK1,sK1)
| big_g(sK1,sK2(sK0,sK1))
| big_g(sK1,sK2(sK0,sK1)) ),
inference(resolution,[],[f12,f10]) ).
fof(f12,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| big_f(sK1,X3)
| big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f24,plain,
( big_f(sK1,sK1)
| ~ big_g(sK1,sK2(sK0,sK1)) ),
inference(subsumption_resolution,[],[f23,f10]) ).
fof(f23,plain,
( ~ big_f(sK0,sK1)
| big_f(sK1,sK1)
| ~ big_g(sK1,sK2(sK0,sK1)) ),
inference(duplicate_literal_removal,[],[f22]) ).
fof(f22,plain,
( ~ big_f(sK0,sK1)
| big_f(sK1,sK1)
| ~ big_g(sK1,sK2(sK0,sK1))
| big_f(sK1,sK1) ),
inference(resolution,[],[f13,f19]) ).
fof(f13,plain,
! [X2,X3] :
( ~ big_g(X3,sK2(X2,X3))
| ~ big_f(X2,X3)
| big_f(sK1,X3)
| ~ big_g(sK1,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f27,plain,
( ~ big_f(sK1,sK1)
| ~ big_f(sK0,sK1) ),
inference(resolution,[],[f25,f16]) ).
fof(f16,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15 % Problem : SYN354+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.38 % Computer : n024.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Tue Apr 30 01:55:06 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 % (26034)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.39 % (26038)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.39 TRYING [1,1]
% 0.21/0.39 TRYING [2,1]
% 0.21/0.39 TRYING [2,2]
% 0.21/0.39 TRYING [3,3]
% 0.21/0.39 TRYING [4,4]
% 0.21/0.39 TRYING [5,5]
% 0.21/0.39 TRYING [6,6]
% 0.21/0.39 TRYING [7,7]
% 0.21/0.40 TRYING [8,8]
% 0.21/0.40 TRYING [9,9]
% 0.21/0.40 % (26035)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.40 % (26037)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.21/0.40 % (26036)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.40 % (26039)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.40 % (26040)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.40 % (26041)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.21/0.40 TRYING [10,10]
% 0.21/0.40 TRYING [1]
% 0.21/0.40 TRYING [2]
% 0.21/0.40 % (26039)First to succeed.
% 0.21/0.40 TRYING [1,1]
% 0.21/0.40 TRYING [1]
% 0.21/0.40 TRYING [2,1]
% 0.21/0.40 TRYING [3]
% 0.21/0.40 TRYING [2]
% 0.21/0.40 TRYING [2,2]
% 0.21/0.40 TRYING [3]
% 0.21/0.40 % (26040)Also succeeded, but the first one will report.
% 0.21/0.40 TRYING [11,11]
% 0.21/0.40 TRYING [4]
% 0.21/0.40 TRYING [3,3]
% 0.21/0.40 TRYING [4]
% 0.21/0.40 % (26039)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (26039)------------------------------
% 0.21/0.40 % (26039)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.40 % (26039)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (26039)Memory used [KB]: 746
% 0.21/0.40 % (26039)Time elapsed: 0.004 s
% 0.21/0.40 % (26039)Instructions burned: 3 (million)
% 0.21/0.40 % (26039)------------------------------
% 0.21/0.40 % (26039)------------------------------
% 0.21/0.40 % (26034)Success in time 0.019 s
%------------------------------------------------------------------------------