TSTP Solution File: MGT008+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT008+1 : TPTP v8.2.0. Released v2.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 : 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 : Tue May 21 00:42:03 EDT 2024
% Result : Theorem 0.70s 0.88s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 15 unt; 0 def)
% Number of atoms : 331 ( 0 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 451 ( 177 ~; 147 |; 117 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 212 ( 182 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f32]) ).
fof(f32,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( ~ greater(sK4,sK3)
& greater(sK6,sK5)
& size(sK1,sK6,sK8)
& size(sK0,sK5,sK7)
& survival_chance(sK1,sK4,sK8)
& survival_chance(sK0,sK3,sK7)
& class(sK1,sK2,sK8)
& class(sK0,sK2,sK7)
& reorganization_free(sK1,sK8,sK8)
& reorganization_free(sK0,sK7,sK7)
& organization(sK1,sK8)
& organization(sK0,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f14,f16]) ).
fof(f16,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> ( ~ greater(sK4,sK3)
& greater(sK6,sK5)
& size(sK1,sK6,sK8)
& size(sK0,sK5,sK7)
& survival_chance(sK1,sK4,sK8)
& survival_chance(sK0,sK3,sK7)
& class(sK1,sK2,sK8)
& class(sK0,sK2,sK7)
& reorganization_free(sK1,sK8,sK8)
& reorganization_free(sK0,sK7,sK7)
& organization(sK1,sK8)
& organization(sK0,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X4,X3) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X3,X4,X11,X12,X5,X6,X9,X10] :
( ( greater(X6,X5)
& size(X3,X6,X10)
& size(X0,X5,X9)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X3,X4,X11,X12,X5,X6,X9,X10] :
( ( greater(X6,X5)
& size(X3,X6,X10)
& size(X0,X5,X9)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_FOL) ).
fof(f58,plain,
~ greater(sK6,sK5),
inference(resolution,[],[f57,f31]) ).
fof(f31,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f17]) ).
fof(f57,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ greater(X0,sK5) ),
inference(subsumption_resolution,[],[f56,f23]) ).
fof(f23,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f17]) ).
fof(f56,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ greater(X0,sK5)
| ~ organization(sK1,sK8) ),
inference(subsumption_resolution,[],[f55,f27]) ).
fof(f27,plain,
class(sK1,sK2,sK8),
inference(cnf_transformation,[],[f17]) ).
fof(f55,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ class(sK1,sK2,sK8)
| ~ greater(X0,sK5)
| ~ organization(sK1,sK8) ),
inference(duplicate_literal_removal,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ~ size(sK1,X0,sK8)
| ~ class(sK1,sK2,sK8)
| ~ greater(X0,sK5)
| ~ organization(sK1,sK8)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f53,f34]) ).
fof(f34,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( inertia(X0,sK9(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f15,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
=> inertia(X0,sK9(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ inertia(X0,sK9(sK1,sK8),X2)
| ~ size(X0,X1,X2)
| ~ class(X0,sK2,X2)
| ~ greater(X1,sK5)
| ~ organization(X0,X2) ),
inference(resolution,[],[f52,f26]) ).
fof(f26,plain,
class(sK0,sK2,sK7),
inference(cnf_transformation,[],[f17]) ).
fof(f52,plain,
! [X2,X3,X0,X1] :
( ~ class(sK0,X3,sK7)
| ~ size(X1,X0,X2)
| ~ inertia(X1,sK9(sK1,sK8),X2)
| ~ class(X1,X3,X2)
| ~ greater(X0,sK5)
| ~ organization(X1,X2) ),
inference(resolution,[],[f51,f30]) ).
fof(f30,plain,
size(sK0,sK5,sK7),
inference(cnf_transformation,[],[f17]) ).
fof(f51,plain,
! [X2,X3,X0,X1,X4] :
( ~ size(sK0,X3,sK7)
| ~ greater(X2,X3)
| ~ size(X0,X2,X1)
| ~ inertia(X0,sK9(sK1,sK8),X1)
| ~ class(X0,X4,X1)
| ~ class(sK0,X4,sK7)
| ~ organization(X0,X1) ),
inference(subsumption_resolution,[],[f50,f22]) ).
fof(f22,plain,
organization(sK0,sK7),
inference(cnf_transformation,[],[f17]) ).
fof(f50,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,sK9(sK1,sK8),X1)
| ~ greater(X2,X3)
| ~ size(X0,X2,X1)
| ~ size(sK0,X3,sK7)
| ~ class(X0,X4,X1)
| ~ class(sK0,X4,sK7)
| ~ organization(X0,X1)
| ~ organization(sK0,sK7) ),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f49,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,sK9(sK1,sK8),X1)
| ~ greater(X2,X3)
| ~ size(X0,X2,X1)
| ~ size(sK0,X3,sK7)
| ~ class(X0,X4,X1)
| ~ class(sK0,X4,sK7)
| ~ organization(X0,X1)
| ~ organization(sK0,sK7)
| ~ organization(sK0,sK7) ),
inference(resolution,[],[f48,f34]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ inertia(X4,sK9(sK0,sK7),X5)
| ~ inertia(X2,sK9(sK1,sK8),X3)
| ~ greater(X0,X1)
| ~ size(X2,X0,X3)
| ~ size(X4,X1,X5)
| ~ class(X2,X6,X3)
| ~ class(X4,X6,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) ),
inference(resolution,[],[f46,f20]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X4,X3)
& inertia(X1,X6,X8)
& inertia(X0,X5,X7)
& size(X1,X4,X8)
& size(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X6,X5) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X3,X4,X5,X6,X7,X8,X9,X10] :
( ( greater(X6,X5)
& inertia(X3,X8,X10)
& inertia(X0,X7,X9)
& size(X3,X6,X10)
& size(X0,X5,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL) ).
fof(f46,plain,
~ greater(sK9(sK1,sK8),sK9(sK0,sK7)),
inference(subsumption_resolution,[],[f45,f23]) ).
fof(f45,plain,
( ~ greater(sK9(sK1,sK8),sK9(sK0,sK7))
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f44,f34]) ).
fof(f44,plain,
! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(X0,sK9(sK0,sK7)) ),
inference(subsumption_resolution,[],[f43,f23]) ).
fof(f43,plain,
! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(X0,sK9(sK0,sK7))
| ~ organization(sK1,sK8) ),
inference(subsumption_resolution,[],[f42,f25]) ).
fof(f25,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
! [X0] :
( ~ inertia(sK1,X0,sK8)
| ~ greater(X0,sK9(sK0,sK7))
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(sK1,sK8) ),
inference(resolution,[],[f41,f29]) ).
fof(f29,plain,
survival_chance(sK1,sK4,sK8),
inference(cnf_transformation,[],[f17]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ survival_chance(X1,sK4,X2)
| ~ inertia(X1,X0,X2)
| ~ greater(X0,sK9(sK0,sK7))
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X1,X2) ),
inference(subsumption_resolution,[],[f40,f22]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ greater(X0,sK9(sK0,sK7))
| ~ inertia(X1,X0,X2)
| ~ survival_chance(X1,sK4,X2)
| ~ reorganization_free(X1,X2,X2)
| ~ organization(X1,X2)
| ~ organization(sK0,sK7) ),
inference(resolution,[],[f39,f34]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ inertia(sK0,X3,sK7)
| ~ greater(X2,X3)
| ~ inertia(X0,X2,X1)
| ~ survival_chance(X0,sK4,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(subsumption_resolution,[],[f38,f22]) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( ~ survival_chance(X0,sK4,X1)
| ~ greater(X2,X3)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK0,X3,sK7)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ organization(sK0,sK7) ),
inference(subsumption_resolution,[],[f37,f24]) ).
fof(f24,plain,
reorganization_free(sK0,sK7,sK7),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( ~ survival_chance(X0,sK4,X1)
| ~ greater(X2,X3)
| ~ inertia(X0,X2,X1)
| ~ inertia(sK0,X3,sK7)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sK0,sK7,sK7)
| ~ organization(X0,X1)
| ~ organization(sK0,sK7) ),
inference(resolution,[],[f36,f28]) ).
fof(f28,plain,
survival_chance(sK0,sK3,sK7),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ survival_chance(X4,sK3,X5)
| ~ survival_chance(X2,sK4,X3)
| ~ greater(X0,X1)
| ~ inertia(X2,X0,X3)
| ~ inertia(X4,X1,X5)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) ),
inference(resolution,[],[f21,f33]) ).
fof(f33,plain,
~ greater(sK4,sK3),
inference(cnf_transformation,[],[f17]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X0,X6,X2)
& inertia(X1,X5,X3)
& inertia(X0,X4,X2)
& reorganization_free(X1,X3,X3)
& reorganization_free(X0,X2,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> greater(X7,X6) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X3,X9,X10,X7,X8,X11,X12] :
( ( greater(X8,X7)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& inertia(X3,X8,X10)
& inertia(X0,X7,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_FOL) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : MGT008+1 : TPTP v8.2.0. Released v2.0.0.
% 0.12/0.15 % 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.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 23:54:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.14/0.36 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.67/0.87 % (23375)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 (2994ds/34Mi)
% 0.67/0.87 % (23376)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 (2994ds/51Mi)
% 0.67/0.87 % (23382)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 (2994ds/56Mi)
% 0.67/0.87 % (23379)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.67/0.87 % (23377)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.67/0.87 % (23380)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.67/0.87 % (23378)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.67/0.87 % (23381)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.70/0.88 % (23378)Also succeeded, but the first one will report.
% 0.70/0.88 % (23377)First to succeed.
% 0.70/0.88 % (23379)Also succeeded, but the first one will report.
% 0.70/0.88 % (23376)Also succeeded, but the first one will report.
% 0.70/0.88 % (23380)Also succeeded, but the first one will report.
% 0.70/0.88 % (23382)Also succeeded, but the first one will report.
% 0.70/0.88 % (23375)Also succeeded, but the first one will report.
% 0.70/0.88 % (23381)Also succeeded, but the first one will report.
% 0.70/0.88 % (23377)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23374"
% 0.70/0.88 % (23377)Refutation found. Thanks to Tanya!
% 0.70/0.88 % SZS status Theorem for theBenchmark
% 0.70/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.88 % (23377)------------------------------
% 0.70/0.88 % (23377)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.88 % (23377)Termination reason: Refutation
% 0.70/0.88
% 0.70/0.88 % (23377)Memory used [KB]: 1053
% 0.70/0.88 % (23377)Time elapsed: 0.006 s
% 0.70/0.88 % (23377)Instructions burned: 7 (million)
% 0.70/0.88 % (23374)Success in time 0.51 s
% 0.70/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------