TSTP Solution File: ALG210+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ALG210+2 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 May 20 18:36:04 EDT 2024
% Result : Theorem 0.17s 0.36s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 5
% Syntax : Number of formulae : 70 ( 54 unt; 0 def)
% Number of atoms : 119 ( 82 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 71 ( 22 ~; 14 |; 29 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 35 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f652,plain,
$false,
inference(subsumption_resolution,[],[f651,f31]) ).
fof(f31,plain,
sK2 != times(sK2,times(sK2,sK2)),
inference(unit_resulting_resolution,[],[f17,f22]) ).
fof(f22,plain,
! [X0] :
( times(X0,times(X0,X0)) != X0
| element(X0) ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( element(X0)
| times(X0,X0) != X1
| times(X0,X1) != X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ( element(X0)
| ! [X1] :
( times(X0,X0) != X1
| times(X0,X1) != X0 ) )
& ( ( times(X0,X0) = sK3(X0)
& times(X0,sK3(X0)) = X0 )
| ~ element(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f12]) ).
fof(f12,plain,
! [X0] :
( ? [X2] :
( times(X0,X0) = X2
& times(X0,X2) = X0 )
=> ( times(X0,X0) = sK3(X0)
& times(X0,sK3(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(f17,plain,
~ element(sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ~ element(sK2)
& sK2 = times(sK0,sK1)
& element(sK1)
& element(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8]) ).
fof(f8,plain,
( ? [X0,X1,X2] :
( ~ element(X2)
& times(X0,X1) = X2
& element(X1)
& element(X0) )
=> ( ~ element(sK2)
& sK2 = times(sK0,sK1)
& element(sK1)
& element(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1,X2] :
( ~ element(X2)
& times(X0,X1) = X2
& element(X1)
& element(X0) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
? [X0,X1,X2] :
( ~ element(X2)
& times(X0,X1) = X2
& element(X1)
& element(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,negated_conjecture,
~ ! [X0,X1,X2] :
( ( times(X0,X1) = X2
& element(X1)
& element(X0) )
=> element(X2) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
! [X0,X1,X2] :
( ( times(X0,X1) = X2
& element(X1)
& element(X0) )
=> element(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
fof(f651,plain,
sK2 = times(sK2,times(sK2,sK2)),
inference(forward_demodulation,[],[f650,f214]) ).
fof(f214,plain,
sK2 = times(sK1,sK0),
inference(forward_demodulation,[],[f213,f130]) ).
fof(f130,plain,
sK2 = times(sK3(sK0),sK2),
inference(superposition,[],[f128,f36]) ).
fof(f36,plain,
! [X0] : times(sK0,times(X0,sK0)) = times(sK3(sK0),X0),
inference(superposition,[],[f21,f27]) ).
fof(f27,plain,
sK3(sK0) = times(sK0,sK0),
inference(unit_resulting_resolution,[],[f14,f19]) ).
fof(f19,plain,
! [X0] :
( ~ element(X0)
| times(X0,X0) = sK3(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f14,plain,
element(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f21,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(f128,plain,
sK2 = times(sK0,times(sK2,sK0)),
inference(forward_demodulation,[],[f125,f16]) ).
fof(f16,plain,
sK2 = times(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f125,plain,
times(sK0,sK1) = times(sK0,times(sK2,sK0)),
inference(superposition,[],[f83,f52]) ).
fof(f52,plain,
times(sK2,sK0) = times(sK1,sK3(sK0)),
inference(superposition,[],[f34,f27]) ).
fof(f34,plain,
! [X0] : times(sK1,times(X0,sK0)) = times(sK2,X0),
inference(superposition,[],[f21,f16]) ).
fof(f83,plain,
! [X0] : times(sK0,X0) = times(sK0,times(X0,sK3(sK0))),
inference(superposition,[],[f21,f78]) ).
fof(f78,plain,
sK0 = times(sK3(sK0),sK0),
inference(forward_demodulation,[],[f75,f23]) ).
fof(f23,plain,
sK0 = times(sK0,sK3(sK0)),
inference(unit_resulting_resolution,[],[f14,f18]) ).
fof(f18,plain,
! [X0] :
( ~ element(X0)
| times(X0,sK3(X0)) = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f75,plain,
times(sK0,sK3(sK0)) = times(sK3(sK0),sK0),
inference(superposition,[],[f36,f27]) ).
fof(f213,plain,
times(sK1,sK0) = times(sK3(sK0),sK2),
inference(forward_demodulation,[],[f209,f181]) ).
fof(f181,plain,
times(sK1,sK0) = times(sK0,times(sK0,sK2)),
inference(superposition,[],[f175,f21]) ).
fof(f175,plain,
times(sK1,sK0) = times(times(sK2,sK0),sK0),
inference(forward_demodulation,[],[f169,f82]) ).
fof(f82,plain,
times(sK2,sK3(sK0)) = times(sK1,sK0),
inference(superposition,[],[f34,f78]) ).
fof(f169,plain,
times(sK2,sK3(sK0)) = times(times(sK2,sK0),sK0),
inference(superposition,[],[f132,f78]) ).
fof(f132,plain,
! [X0] : times(sK2,X0) = times(times(sK2,sK0),times(X0,sK0)),
inference(superposition,[],[f21,f128]) ).
fof(f209,plain,
times(sK3(sK0),sK2) = times(sK0,times(sK0,sK2)),
inference(superposition,[],[f36,f199]) ).
fof(f199,plain,
times(sK2,sK0) = times(sK0,sK2),
inference(forward_demodulation,[],[f196,f130]) ).
fof(f196,plain,
times(sK2,sK0) = times(sK0,times(sK3(sK0),sK2)),
inference(superposition,[],[f168,f21]) ).
fof(f168,plain,
times(sK2,sK0) = times(times(sK2,sK0),sK3(sK0)),
inference(superposition,[],[f132,f27]) ).
fof(f650,plain,
times(sK2,times(sK2,sK2)) = times(sK1,sK0),
inference(forward_demodulation,[],[f649,f82]) ).
fof(f649,plain,
times(sK2,times(sK2,sK2)) = times(sK2,sK3(sK0)),
inference(forward_demodulation,[],[f644,f257]) ).
fof(f257,plain,
times(sK2,sK2) = times(sK0,times(sK1,sK2)),
inference(superposition,[],[f219,f218]) ).
fof(f218,plain,
times(sK1,sK2) = times(sK2,sK1),
inference(superposition,[],[f34,f214]) ).
fof(f219,plain,
! [X0] : times(sK2,X0) = times(sK0,times(X0,sK1)),
inference(superposition,[],[f21,f214]) ).
fof(f644,plain,
times(sK2,sK3(sK0)) = times(sK2,times(sK0,times(sK1,sK2))),
inference(superposition,[],[f629,f119]) ).
fof(f119,plain,
times(sK3(sK0),sK3(sK1)) = times(sK0,times(sK1,sK2)),
inference(superposition,[],[f36,f108]) ).
fof(f108,plain,
times(sK3(sK1),sK0) = times(sK1,sK2),
inference(superposition,[],[f38,f16]) ).
fof(f38,plain,
! [X0] : times(sK1,times(X0,sK1)) = times(sK3(sK1),X0),
inference(superposition,[],[f21,f28]) ).
fof(f28,plain,
sK3(sK1) = times(sK1,sK1),
inference(unit_resulting_resolution,[],[f15,f19]) ).
fof(f15,plain,
element(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f629,plain,
! [X0] : times(sK2,X0) = times(sK2,times(X0,sK3(sK1))),
inference(superposition,[],[f21,f620]) ).
fof(f620,plain,
sK2 = times(sK3(sK1),sK2),
inference(forward_demodulation,[],[f619,f230]) ).
fof(f230,plain,
sK2 = times(sK2,sK3(sK1)),
inference(forward_demodulation,[],[f229,f214]) ).
fof(f229,plain,
times(sK1,sK0) = times(sK2,sK3(sK1)),
inference(forward_demodulation,[],[f228,f89]) ).
fof(f89,plain,
times(sK1,sK0) = times(sK3(sK1),sK2),
inference(superposition,[],[f37,f16]) ).
fof(f37,plain,
! [X0] : times(sK3(sK1),times(X0,sK1)) = times(sK1,X0),
inference(superposition,[],[f21,f24]) ).
fof(f24,plain,
sK1 = times(sK1,sK3(sK1)),
inference(unit_resulting_resolution,[],[f15,f18]) ).
fof(f228,plain,
times(sK3(sK1),sK2) = times(sK2,sK3(sK1)),
inference(forward_demodulation,[],[f225,f121]) ).
fof(f121,plain,
times(sK2,sK3(sK1)) = times(sK1,times(sK1,sK2)),
inference(superposition,[],[f34,f108]) ).
fof(f225,plain,
times(sK3(sK1),sK2) = times(sK1,times(sK1,sK2)),
inference(superposition,[],[f38,f218]) ).
fof(f619,plain,
times(sK3(sK1),sK2) = times(sK2,sK3(sK1)),
inference(forward_demodulation,[],[f611,f214]) ).
fof(f611,plain,
times(sK2,sK3(sK1)) = times(sK3(sK1),times(sK1,sK0)),
inference(superposition,[],[f231,f89]) ).
fof(f231,plain,
! [X0] : times(sK2,X0) = times(sK3(sK1),times(X0,sK2)),
inference(superposition,[],[f21,f230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : ALG210+2 : TPTP v8.2.0. Released v3.1.0.
% 0.02/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 23:29:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 % (16088)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (16091)WARNING: value z3 for option sas not known
% 0.11/0.34 % (16093)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.11/0.34 % (16090)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.34 % (16095)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.11/0.34 % (16094)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.11/0.34 % (16089)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.34 % (16091)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.11/0.34 TRYING [1]
% 0.11/0.34 % (16092)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [3]
% 0.11/0.35 TRYING [4]
% 0.11/0.35 TRYING [4]
% 0.17/0.35 TRYING [5]
% 0.17/0.36 TRYING [5]
% 0.17/0.36 % (16095)First to succeed.
% 0.17/0.36 % (16095)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16088"
% 0.17/0.36 % (16095)Refutation found. Thanks to Tanya!
% 0.17/0.36 % SZS status Theorem for theBenchmark
% 0.17/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.36 % (16095)------------------------------
% 0.17/0.36 % (16095)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.17/0.36 % (16095)Termination reason: Refutation
% 0.17/0.36
% 0.17/0.36 % (16095)Memory used [KB]: 1104
% 0.17/0.36 % (16095)Time elapsed: 0.018 s
% 0.17/0.36 % (16095)Instructions burned: 39 (million)
% 0.17/0.36 % (16088)Success in time 0.031 s
%------------------------------------------------------------------------------