TSTP Solution File: SYN078+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN078+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 : n006.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:02:07 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 105 ( 18 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 113 ( 40 ~; 40 |; 22 &)
% ( 3 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 38 ( 25 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f38,plain,
$false,
inference(subsumption_resolution,[],[f37,f29]) ).
fof(f29,plain,
~ big_p(sK1),
inference(unit_resulting_resolution,[],[f27,f16]) ).
fof(f16,plain,
( ~ big_p(f(sK0))
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ( ~ big_p(f(sK0))
& big_p(sK0) )
| ( ~ big_p(sK1)
& sK1 = f(sK2)
& big_p(sK2) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f8,f7,f6]) ).
fof(f6,plain,
( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
=> ( ~ big_p(f(sK0))
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) )
=> ( ~ big_p(sK1)
& ? [X2] :
( f(X2) = sK1
& big_p(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] :
( f(X2) = sK1
& big_p(X2) )
=> ( sK1 = f(sK2)
& big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
| ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ( ? [X2] :
( ~ big_p(f(X2))
& big_p(X2) )
| ? [X0] :
( ~ big_p(X0)
& ? [X1] :
( f(X1) = X0
& big_p(X1) ) ) )
& ( ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) )
| ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) )
<~> ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel56) ).
fof(f27,plain,
big_p(f(sK0)),
inference(unit_resulting_resolution,[],[f26,f20]) ).
fof(f20,plain,
! [X3] :
( ~ big_p(X3)
| big_p(f(X3)) ),
inference(subsumption_resolution,[],[f18,f19]) ).
fof(f19,plain,
! [X5] :
( big_p(f(X5))
| ~ big_p(X5)
| ~ sP3 ),
inference(general_splitting,[],[f17,f18_D]) ).
fof(f17,plain,
! [X3,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(f(X5))
| ~ big_p(X5) ),
inference(equality_resolution,[],[f10]) ).
fof(f10,plain,
! [X3,X4,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(X4)
| f(X5) != X4
| ~ big_p(X5) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X3] :
( big_p(f(X3))
| ~ big_p(X3)
| sP3 ),
inference(cnf_transformation,[],[f18_D]) ).
fof(f18_D,plain,
( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
<=> ~ sP3 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP3])]) ).
fof(f26,plain,
big_p(sK0),
inference(subsumption_resolution,[],[f25,f13]) ).
fof(f13,plain,
( ~ big_p(sK1)
| big_p(sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f25,plain,
( big_p(sK1)
| big_p(sK0) ),
inference(superposition,[],[f21,f24]) ).
fof(f24,plain,
sK1 = f(sK2),
inference(subsumption_resolution,[],[f23,f15]) ).
fof(f15,plain,
( ~ big_p(f(sK0))
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
( sK1 = f(sK2)
| big_p(f(sK0)) ),
inference(resolution,[],[f12,f20]) ).
fof(f12,plain,
( big_p(sK0)
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
( big_p(f(sK2))
| big_p(sK0) ),
inference(resolution,[],[f20,f11]) ).
fof(f11,plain,
( big_p(sK2)
| big_p(sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f37,plain,
big_p(sK1),
inference(forward_demodulation,[],[f35,f24]) ).
fof(f35,plain,
big_p(f(sK2)),
inference(unit_resulting_resolution,[],[f30,f20]) ).
fof(f30,plain,
big_p(sK2),
inference(unit_resulting_resolution,[],[f27,f14]) ).
fof(f14,plain,
( ~ big_p(f(sK0))
| big_p(sK2) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 01:40:05 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (17599)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (17602)WARNING: value z3 for option sas not known
% 0.14/0.37 % (17607)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.37 % (17601)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (17605)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_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.37 % (17600)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (17602)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (17606)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.37 % (17603)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 TRYING [1]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (17607)First to succeed.
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 % (17605)Also succeeded, but the first one will report.
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [5]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [5]
% 0.14/0.38 % (17606)Also succeeded, but the first one will report.
% 0.14/0.38 % (17607)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 % (17607)------------------------------
% 0.14/0.38 % (17607)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38 % (17607)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (17607)Memory used [KB]: 755
% 0.14/0.38 % (17607)Time elapsed: 0.004 s
% 0.14/0.38 % (17607)Instructions burned: 3 (million)
% 0.14/0.38 % (17607)------------------------------
% 0.14/0.38 % (17607)------------------------------
% 0.14/0.38 % (17599)Success in time 0.009 s
%------------------------------------------------------------------------------