TSTP Solution File: GEO211+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GEO211+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n020.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 05:16:09 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 9 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 13 ( 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(subsumption_resolution,[],[f89,f66]) ).
fof(f66,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).
fof(f89,plain,
convergent_lines(sK1,sK1),
inference(resolution,[],[f71,f63]) ).
fof(f63,plain,
~ unorthogonal_lines(sK1,sK1),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
~ unorthogonal_lines(sK1,sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f32,f59]) ).
fof(f59,plain,
( ? [X0] : ~ unorthogonal_lines(X0,X0)
=> ~ unorthogonal_lines(sK1,sK1) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
? [X0] : ~ unorthogonal_lines(X0,X0),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
~ ! [X0] : unorthogonal_lines(X0,X0),
inference(rectify,[],[f24]) ).
fof(f24,negated_conjecture,
~ ! [X5] : unorthogonal_lines(X5,X5),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
! [X5] : unorthogonal_lines(X5,X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f71,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X5,X6] :
( unorthogonal_lines(X5,X6)
| convergent_lines(X5,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',occu1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GEO211+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.37 % Computer : n020.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 22:00:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 % (19194)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (19197)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.15/0.39 % (19201)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.15/0.39 % (19198)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.39 % (19199)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.39 % (19196)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39 % (19197)Also succeeded, but the first one will report.
% 0.15/0.39 TRYING [1]
% 0.15/0.39 % (19199)First to succeed.
% 0.15/0.39 % (19200)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.39 % (19201)Also succeeded, but the first one will report.
% 0.15/0.39 % (19199)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19194"
% 0.15/0.39 TRYING [1,1]
% 0.15/0.39 % (19200)Also succeeded, but the first one will report.
% 0.15/0.39 Cannot enumerate next child to try in an incomplete setup
% 0.15/0.39 % (19198)Refutation not found, incomplete strategy% (19198)------------------------------
% 0.15/0.39 % (19198)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (19198)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39 % (19198)Memory used [KB]: 854
% 0.15/0.39 % (19198)Time elapsed: 0.003 s
% 0.15/0.39 % (19198)Instructions burned: 4 (million)
% 0.15/0.39 % (19199)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (19199)------------------------------
% 0.15/0.39 % (19199)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (19199)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (19199)Memory used [KB]: 791
% 0.15/0.39 % (19199)Time elapsed: 0.002 s
% 0.15/0.39 % (19199)Instructions burned: 3 (million)
% 0.15/0.39 % (19194)Success in time 0.017 s
%------------------------------------------------------------------------------