TSTP Solution File: SYO506_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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 May 21 09:05:34 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 118 ( 46 equ)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 45 ( 23 ~; 14 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 76 ( 74 fml; 2 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 3-3 aty)
% Number of variables : 49 ( 45 !; 4 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
c: ( $o * $i * $i ) > $i ).
tff(func_def_3,type,
bG0: ( $i * $i ) > $o ).
tff(f36,plain,
$false,
inference(subsumption_resolution,[],[f34,f29]) ).
tff(f29,plain,
sK1 != sK2,
inference(forward_demodulation,[],[f28,f14]) ).
tff(f14,plain,
! [X2: $i,X3: $i] : ( c($true,X2,X3) = X2 ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ! [X0,X1] : ( c($false,X0,X1) = X1 )
& ! [X2,X3] : ( c($true,X2,X3) = X2 )
& ( sK2 != c(bG0(sK2,sK1),sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f9,f10]) ).
tff(f10,plain,
( ? [X4,X5] : ( c(bG0(X5,X4),X4,X5) != X5 )
=> ( sK2 != c(bG0(sK2,sK1),sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ! [X0,X1] : ( c($false,X0,X1) = X1 )
& ! [X2,X3] : ( c($true,X2,X3) = X2 )
& ? [X4,X5] : ( c(bG0(X5,X4),X4,X5) != X5 ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
| ~ ! [X2,X3] : ( c($true,X2,X3) = X2 )
| ! [X4,X5] : ( c(bG0(X5,X4),X4,X5) = X5 ) ),
inference(fool_elimination,[],[f5,f6]) ).
tff(f6,plain,
! [X5,X4] :
( ( X4 = X5 )
<=> ( $true = bG0(X5,X4) ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f5,plain,
~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
| ~ ! [X2,X3] : ( c($true,X2,X3) = X2 )
| ! [X4,X5] : ( c(X4 = X5,X4,X5) = X5 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
| ~ ! [X0,X1] : ( c($true,X0,X1) = X0 )
| ! [X0,X1] : ( c(X0 = X1,X0,X1) = X1 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
| ~ ! [X0,X1] : ( c($true,X0,X1) = X0 )
| ! [X0,X1] : ( c(X0 = X1,X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim) ).
tff(f28,plain,
sK2 != c($true,sK1,sK2),
inference(backward_demodulation,[],[f13,f27]) ).
tff(f27,plain,
$true = bG0(sK2,sK1),
inference(subsumption_resolution,[],[f23,f15]) ).
tff(f15,plain,
! [X0: $i,X1: $i] : ( c($false,X0,X1) = X1 ),
inference(cnf_transformation,[],[f11]) ).
tff(f23,plain,
( ( sK2 != c($false,sK1,sK2) )
| ( $true = bG0(sK2,sK1) ) ),
inference(superposition,[],[f13,f4]) ).
tff(f4,plain,
! [X0: $o] :
( ( $false = (X0) )
| ( $true = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f13,plain,
sK2 != c(bG0(sK2,sK1),sK1,sK2),
inference(cnf_transformation,[],[f11]) ).
tff(f34,plain,
sK1 = sK2,
inference(trivial_inequality_removal,[],[f33]) ).
tff(f33,plain,
( ( $true != $true )
| ( sK1 = sK2 ) ),
inference(superposition,[],[f17,f27]) ).
tff(f17,plain,
! [X0: $i,X1: $i] :
( ( $true != bG0(X0,X1) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0,X1] :
( ( ( X0 = X1 )
| ( $true != bG0(X0,X1) ) )
& ( ( $true = bG0(X0,X1) )
| ( X0 != X1 ) ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f8,plain,
! [X0,X1] :
( ( X0 = X1 )
<=> ( $true = bG0(X0,X1) ) ),
inference(rectify,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:33:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TX0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.72 % (1073)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.72 % (1068)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.72 % (1070)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.72 % (1069)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.72 % (1073)Refutation not found, incomplete strategy% (1073)------------------------------
% 0.55/0.72 % (1073)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (1073)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72
% 0.55/0.72 % (1073)Memory used [KB]: 957
% 0.55/0.72 % (1073)Time elapsed: 0.002 s
% 0.55/0.72 % (1073)Instructions burned: 3 (million)
% 0.55/0.72 % (1073)------------------------------
% 0.55/0.72 % (1073)------------------------------
% 0.55/0.72 % (1068)Refutation not found, incomplete strategy% (1068)------------------------------
% 0.55/0.72 % (1068)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (1068)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72
% 0.55/0.72 % (1068)Memory used [KB]: 966
% 0.55/0.72 % (1068)Time elapsed: 0.003 s
% 0.55/0.72 % (1068)Instructions burned: 2 (million)
% 0.55/0.72 % (1068)------------------------------
% 0.55/0.72 % (1068)------------------------------
% 0.55/0.72 % (1070)First to succeed.
% 0.55/0.73 % (1070)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1067"
% 0.55/0.73 % (1069)Also succeeded, but the first one will report.
% 0.55/0.73 % (1075)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.73 % (1070)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (1070)------------------------------
% 0.55/0.73 % (1070)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (1070)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (1070)Memory used [KB]: 985
% 0.55/0.73 % (1070)Time elapsed: 0.004 s
% 0.55/0.73 % (1070)Instructions burned: 4 (million)
% 0.55/0.73 % (1067)Success in time 0.374 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------