TSTP Solution File: MSC012+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n031.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 Apr 30 13:57:30 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 30 ~; 29 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 44 ( 40 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f72,plain,
$false,
inference(subsumption_resolution,[],[f71,f70]) ).
fof(f70,plain,
! [X0] : ~ p(X0),
inference(subsumption_resolution,[],[f69,f23]) ).
fof(f23,plain,
! [X0] :
( ~ p(sK1(X0))
| ~ p(X0) ),
inference(resolution,[],[f22,f19]) ).
fof(f19,plain,
! [X0] : less(X0,sK1(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : less(X0,sK1(X0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f4,f14]) ).
fof(f14,plain,
! [X0] :
( ? [X1] : less(X0,X1)
=> less(X0,sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f4,axiom,
! [X0] :
? [X1] : less(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',serial_less) ).
fof(f22,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ p(X1)
| ~ p(X0) ),
inference(subsumption_resolution,[],[f20,f16]) ).
fof(f16,plain,
~ goal,
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
~ goal,
inference(flattening,[],[f6]) ).
fof(f6,negated_conjecture,
~ goal,
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f20,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ( p(X1)
& less(X0,X1)
& p(X0) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_to_right) ).
fof(f69,plain,
! [X0] :
( ~ p(X0)
| p(sK1(X0)) ),
inference(resolution,[],[f68,f18]) ).
fof(f18,plain,
! [X0] :
( p(sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ( p(sK0(X0))
& less(X0,sK0(X0)) )
| p(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f2,f12]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( p(X1)
& less(X0,X1) )
=> ( p(sK0(X0))
& less(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f2,axiom,
! [X0] :
( ? [X1] :
( p(X1)
& less(X0,X1) )
| p(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_to_left) ).
fof(f68,plain,
! [X0] :
( ~ p(sK0(sK1(X0)))
| ~ p(X0) ),
inference(subsumption_resolution,[],[f67,f23]) ).
fof(f67,plain,
! [X0] :
( p(sK1(X0))
| ~ p(sK0(sK1(X0)))
| ~ p(X0) ),
inference(resolution,[],[f55,f22]) ).
fof(f55,plain,
! [X0] :
( less(X0,sK0(sK1(X0)))
| p(sK1(X0)) ),
inference(resolution,[],[f26,f19]) ).
fof(f26,plain,
! [X0,X1] :
( ~ less(X0,X1)
| less(X0,sK0(X1))
| p(X1) ),
inference(resolution,[],[f21,f17]) ).
fof(f17,plain,
! [X0] :
( less(X0,sK0(X0))
| p(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| less(X0,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_less) ).
fof(f71,plain,
! [X0] : p(X0),
inference(resolution,[],[f70,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n031.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 22:40:58 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (28121)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (28123)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37 % (28124)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.13/0.37 % (28125)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.37 % (28126)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37 % (28122)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37 % (28127)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37 % (28128)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.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 % (28126)First to succeed.
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [4]
% 0.13/0.37 TRYING [4]
% 0.13/0.37 TRYING [4]
% 0.13/0.37 % (28124)Also succeeded, but the first one will report.
% 0.13/0.37 TRYING [4]
% 0.13/0.37 TRYING [5]
% 0.13/0.37 TRYING [5]
% 0.13/0.37 TRYING [5]
% 0.13/0.37 TRYING [5]
% 0.13/0.37 % (28127)Also succeeded, but the first one will report.
% 0.13/0.37 % (28126)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (28126)------------------------------
% 0.13/0.37 % (28126)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (28126)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (28126)Memory used [KB]: 753
% 0.13/0.37 % (28126)Time elapsed: 0.004 s
% 0.13/0.37 % (28126)Instructions burned: 4 (million)
% 0.13/0.37 % (28126)------------------------------
% 0.13/0.37 % (28126)------------------------------
% 0.13/0.37 % (28121)Success in time 0.008 s
%------------------------------------------------------------------------------