TSTP Solution File: ALG210+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ALG210+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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 : Sun May 5 04:28:47 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 64 ( 48 unt; 0 def)
% Number of atoms : 106 ( 69 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 75 ( 33 ~; 14 |; 22 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 48 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f597,plain,
$false,
inference(subsumption_resolution,[],[f596,f346]) ).
fof(f346,plain,
! [X0] : times(X0,sK0) = times(sK0,X0),
inference(superposition,[],[f278,f195]) ).
fof(f195,plain,
! [X0] : times(sK0,X0) = times(sK0,times(sK2(sK0),X0)),
inference(forward_demodulation,[],[f180,f39]) ).
fof(f39,plain,
! [X0] : times(sK2(sK0),times(X0,sK0)) = times(sK0,X0),
inference(superposition,[],[f20,f22]) ).
fof(f22,plain,
sK0 = times(sK0,sK2(sK0)),
inference(unit_resulting_resolution,[],[f14,f17]) ).
fof(f17,plain,
! [X0] :
( ~ element(X0)
| times(X0,sK2(X0)) = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ( element(X0)
| ! [X1] :
( times(X0,X0) != X1
| times(X0,X1) != X0 ) )
& ( ( times(X0,X0) = sK2(X0)
& times(X0,sK2(X0)) = X0 )
| ~ element(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f11,f12]) ).
fof(f12,plain,
! [X0] :
( ? [X2] :
( times(X0,X0) = X2
& times(X0,X2) = X0 )
=> ( times(X0,X0) = sK2(X0)
& times(X0,sK2(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0] :
( ( element(X0)
| ! [X1] :
( times(X0,X0) != X1
| times(X0,X1) != X0 ) )
& ( ? [X2] :
( times(X0,X0) = X2
& times(X0,X2) = X0 )
| ~ element(X0) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X0] :
( ( element(X0)
| ! [X1] :
( times(X0,X0) != X1
| times(X0,X1) != X0 ) )
& ( ? [X1] :
( times(X0,X0) = X1
& times(X0,X1) = X0 )
| ~ element(X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X0] :
( element(X0)
<=> ? [X1] :
( times(X0,X0) = X1
& times(X0,X1) = X0 ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1] :
( element(X1)
<=> ? [X2] :
( times(X1,X1) = X2
& times(X1,X2) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f14,plain,
element(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ~ element(times(sK0,sK1))
& element(sK1)
& element(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
( ~ element(times(X0,X1))
& element(X1)
& element(X0) )
=> ( ~ element(times(sK0,sK1))
& element(sK1)
& element(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
( ~ element(times(X0,X1))
& element(X1)
& element(X0) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
? [X0,X1] :
( ~ element(times(X0,X1))
& element(X1)
& element(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,negated_conjecture,
~ ! [X0,X1] :
( ( element(X1)
& element(X0) )
=> element(times(X0,X1)) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
! [X0,X1] :
( ( element(X1)
& element(X0) )
=> element(times(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
fof(f20,plain,
! [X2,X0,X1] : times(times(X0,X1),X2) = times(X1,times(X2,X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] : times(times(X0,X1),X2) = times(X1,times(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f180,plain,
! [X0] : times(sK2(sK0),times(X0,sK0)) = times(sK0,times(sK2(sK0),X0)),
inference(superposition,[],[f178,f37]) ).
fof(f37,plain,
! [X0] : times(sK0,times(X0,sK0)) = times(sK2(sK0),X0),
inference(superposition,[],[f20,f26]) ).
fof(f26,plain,
sK2(sK0) = times(sK0,sK0),
inference(unit_resulting_resolution,[],[f14,f18]) ).
fof(f18,plain,
! [X0] :
( ~ element(X0)
| times(X0,X0) = sK2(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f178,plain,
! [X0] : times(sK2(sK0),X0) = times(sK0,times(sK0,X0)),
inference(forward_demodulation,[],[f174,f63]) ).
fof(f63,plain,
! [X0] : times(sK2(sK0),X0) = times(sK2(sK0),times(X0,sK2(sK0))),
inference(superposition,[],[f20,f61]) ).
fof(f61,plain,
sK2(sK0) = times(sK2(sK0),sK2(sK0)),
inference(forward_demodulation,[],[f59,f26]) ).
fof(f59,plain,
times(sK0,sK0) = times(sK2(sK0),sK2(sK0)),
inference(superposition,[],[f37,f57]) ).
fof(f57,plain,
sK0 = times(sK2(sK0),sK0),
inference(forward_demodulation,[],[f53,f22]) ).
fof(f53,plain,
times(sK0,sK2(sK0)) = times(sK2(sK0),sK0),
inference(superposition,[],[f37,f26]) ).
fof(f174,plain,
! [X0] : times(sK2(sK0),times(X0,sK2(sK0))) = times(sK0,times(sK0,X0)),
inference(superposition,[],[f54,f152]) ).
fof(f152,plain,
! [X0] : times(sK0,X0) = times(sK2(sK0),times(sK0,X0)),
inference(forward_demodulation,[],[f130,f60]) ).
fof(f60,plain,
! [X0] : times(sK0,X0) = times(sK0,times(X0,sK2(sK0))),
inference(superposition,[],[f20,f57]) ).
fof(f130,plain,
! [X0] : times(sK0,times(X0,sK2(sK0))) = times(sK2(sK0),times(sK0,X0)),
inference(superposition,[],[f54,f26]) ).
fof(f54,plain,
! [X0,X1] : times(sK2(sK0),times(X0,X1)) = times(sK0,times(X1,times(sK0,X0))),
inference(superposition,[],[f37,f20]) ).
fof(f278,plain,
! [X0] : times(X0,sK0) = times(sK0,times(sK2(sK0),X0)),
inference(superposition,[],[f258,f20]) ).
fof(f258,plain,
! [X0] : times(X0,sK0) = times(times(X0,sK0),sK2(sK0)),
inference(forward_demodulation,[],[f247,f22]) ).
fof(f247,plain,
! [X0] : times(X0,times(sK0,sK2(sK0))) = times(times(X0,sK0),sK2(sK0)),
inference(superposition,[],[f58,f26]) ).
fof(f58,plain,
! [X0,X1] : times(times(X0,sK0),times(X1,sK0)) = times(X0,times(X1,sK2(sK0))),
inference(forward_demodulation,[],[f56,f20]) ).
fof(f56,plain,
! [X0,X1] : times(times(X0,sK0),times(X1,sK0)) = times(times(sK2(sK0),X0),X1),
inference(superposition,[],[f20,f37]) ).
fof(f596,plain,
times(sK0,sK1) != times(sK1,sK0),
inference(superposition,[],[f394,f81]) ).
fof(f81,plain,
! [X0] : times(sK1,X0) = times(sK1,times(X0,sK2(sK1))),
inference(superposition,[],[f20,f78]) ).
fof(f78,plain,
sK1 = times(sK2(sK1),sK1),
inference(forward_demodulation,[],[f74,f23]) ).
fof(f23,plain,
sK1 = times(sK1,sK2(sK1)),
inference(unit_resulting_resolution,[],[f15,f17]) ).
fof(f15,plain,
element(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f74,plain,
times(sK1,sK2(sK1)) = times(sK2(sK1),sK1),
inference(superposition,[],[f38,f27]) ).
fof(f27,plain,
sK2(sK1) = times(sK1,sK1),
inference(unit_resulting_resolution,[],[f15,f18]) ).
fof(f38,plain,
! [X0] : times(sK1,times(X0,sK1)) = times(sK2(sK1),X0),
inference(superposition,[],[f20,f27]) ).
fof(f394,plain,
times(sK0,sK1) != times(sK1,times(sK0,sK2(sK1))),
inference(forward_demodulation,[],[f393,f27]) ).
fof(f393,plain,
times(sK0,sK1) != times(sK1,times(sK0,times(sK1,sK1))),
inference(forward_demodulation,[],[f383,f97]) ).
fof(f97,plain,
! [X0,X1] : times(sK0,times(X0,X1)) = times(sK2(sK0),times(X1,times(sK0,X0))),
inference(superposition,[],[f39,f20]) ).
fof(f383,plain,
times(sK0,sK1) != times(sK1,times(sK2(sK0),times(sK1,times(sK0,sK1)))),
inference(superposition,[],[f126,f346]) ).
fof(f126,plain,
times(sK0,sK1) != times(sK1,times(sK2(sK0),times(sK1,times(sK1,sK0)))),
inference(forward_demodulation,[],[f125,f20]) ).
fof(f125,plain,
times(sK0,sK1) != times(sK1,times(sK2(sK0),times(times(sK0,sK1),sK1))),
inference(forward_demodulation,[],[f124,f20]) ).
fof(f124,plain,
times(sK0,sK1) != times(sK1,times(times(sK1,sK2(sK0)),times(sK0,sK1))),
inference(forward_demodulation,[],[f123,f20]) ).
fof(f123,plain,
times(sK0,sK1) != times(sK1,times(times(sK1,times(sK1,sK2(sK0))),sK0)),
inference(superposition,[],[f35,f20]) ).
fof(f35,plain,
times(sK0,sK1) != times(times(sK0,sK1),times(sK1,times(sK1,sK2(sK0)))),
inference(forward_demodulation,[],[f34,f26]) ).
fof(f34,plain,
times(sK0,sK1) != times(times(sK0,sK1),times(sK1,times(sK1,times(sK0,sK0)))),
inference(forward_demodulation,[],[f33,f20]) ).
fof(f33,plain,
times(sK0,sK1) != times(times(sK0,sK1),times(sK1,times(times(sK0,sK1),sK0))),
inference(forward_demodulation,[],[f30,f20]) ).
fof(f30,plain,
times(sK0,sK1) != times(times(sK0,sK1),times(times(sK0,sK1),times(sK0,sK1))),
inference(unit_resulting_resolution,[],[f16,f21]) ).
fof(f21,plain,
! [X0] :
( times(X0,times(X0,X0)) != X0
| element(X0) ),
inference(equality_resolution,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( element(X0)
| times(X0,X0) != X1
| times(X0,X1) != X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f16,plain,
~ element(times(sK0,sK1)),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG210+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 19:59:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % (14981)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (14986)WARNING: value z3 for option sas not known
% 0.13/0.37 % (14987)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37 % (14983)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37 % (14988)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.13/0.37 % (14986)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.13/0.37 % (14989)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.13/0.37 % (14990)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.13/0.37 % (14985)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [2]
% 0.13/0.38 TRYING [2]
% 0.13/0.38 TRYING [3]
% 0.13/0.38 TRYING [3]
% 0.13/0.38 TRYING [4]
% 0.13/0.38 TRYING [4]
% 0.13/0.39 TRYING [5]
% 0.13/0.39 % (14990)First to succeed.
% 0.13/0.39 % (14990)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14981"
% 0.13/0.39 TRYING [5]
% 0.13/0.39 % (14990)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.39 % (14990)------------------------------
% 0.13/0.39 % (14990)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.39 % (14990)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (14990)Memory used [KB]: 930
% 0.13/0.39 % (14990)Time elapsed: 0.018 s
% 0.13/0.39 % (14990)Instructions burned: 30 (million)
% 0.13/0.39 % (14981)Success in time 0.035 s
%------------------------------------------------------------------------------