TSTP Solution File: LCL218-10 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n022.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:41:03 EDT 2024
% Result : Unsatisfiable 182.83s 30.84s
% Output : Refutation 182.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 66 ( 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f530458,plain,
$false,
inference(trivial_inequality_removal,[],[f530189]) ).
fof(f530189,plain,
true != true,
inference(superposition,[],[f10,f530185]) ).
fof(f530185,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(or(X0,X1)),X2)),or(not(X0),X2))),
inference(superposition,[],[f309883,f1]) ).
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f309883,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(or(X1,X2)),X0)),or(not(X1),X0))),true),
inference(superposition,[],[f80,f309873]) ).
fof(f309873,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,not(or(X1,X2)))),or(not(X1),X0))),
inference(superposition,[],[f188627,f1]) ).
fof(f188627,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,not(or(X0,X2)))),or(not(X0),X1))),true),
inference(superposition,[],[f44,f188557]) ).
fof(f188557,plain,
! [X2,X0,X1] : true = theorem(or(not(X0),or(not(or(X1,not(or(X0,X2)))),X1))),
inference(superposition,[],[f97557,f1]) ).
fof(f97557,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(X1),or(not(or(X2,not(or(X1,X0)))),X2))),true),
inference(superposition,[],[f83,f97541]) ).
fof(f97541,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,X1)),or(not(or(X2,not(or(X1,X0)))),X2))),
inference(superposition,[],[f646,f1]) ).
fof(f646,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,X0)),or(not(or(X2,not(or(X0,X1)))),X2))),true),
inference(superposition,[],[f80,f642]) ).
fof(f642,plain,
! [X0,X1] : true = theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(superposition,[],[f136,f1]) ).
fof(f136,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(X1,or(not(or(X0,X1)),X0))),true),
inference(superposition,[],[f44,f26]) ).
fof(f26,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[],[f13,f1]) ).
fof(f13,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f7,f4]) ).
fof(f4,axiom,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f7,axiom,
! [X3] : true = ifeq(axiom(X3),true,theorem(X3),true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f83,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X1,X0)),X2)),true,theorem(or(not(X0),X2)),true),
inference(forward_demodulation,[],[f74,f1]) ).
fof(f74,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X1,X0)),X2)),true,ifeq(true,true,theorem(or(not(X0),X2)),true),true),
inference(superposition,[],[f9,f3]) ).
fof(f3,axiom,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f9,axiom,
! [X3,X4,X5] : true = ifeq(theorem(or(not(X4),X5)),true,ifeq(axiom(or(not(X3),X4)),true,theorem(or(not(X3),X5)),true),true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
fof(f44,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f36,f1]) ).
fof(f36,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,ifeq(true,true,theorem(or(X1,or(X0,X2))),true),true),
inference(superposition,[],[f8,f5]) ).
fof(f5,axiom,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,axiom,
! [X3,X4] : true = ifeq(theorem(X4),true,ifeq(axiom(or(not(X4),X3)),true,theorem(X3),true),true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f80,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X1,X0)),X2)),true,theorem(or(not(or(X0,X1)),X2)),true),
inference(forward_demodulation,[],[f71,f1]) ).
fof(f71,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X1,X0)),X2)),true,ifeq(true,true,theorem(or(not(or(X0,X1)),X2)),true),true),
inference(superposition,[],[f9,f4]) ).
fof(f10,axiom,
true != theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% 0.08/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 23:01:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (4245)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (4253)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.14/0.38 % (4250)WARNING: value z3 for option sas not known
% 0.14/0.38 % (4247)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (4249)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (4252)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (4250)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.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [3]
% 0.21/0.41 % (4256)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.21/0.42 % (4255)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.21/0.42 TRYING [3]
% 0.21/0.44 TRYING [4]
% 0.21/0.51 TRYING [4]
% 1.80/0.72 TRYING [5]
% 6.73/1.48 TRYING [1]
% 6.73/1.49 TRYING [2]
% 6.91/1.49 TRYING [3]
% 6.91/1.52 TRYING [4]
% 8.64/1.78 TRYING [5]
% 23.69/4.31 TRYING [6]
% 26.38/4.80 TRYING [6]
% 28.17/5.05 TRYING [5]
% 182.32/30.73 TRYING [7]
% 182.83/30.81 % (4250)First to succeed.
% 182.83/30.84 % (4250)Refutation found. Thanks to Tanya!
% 182.83/30.84 % SZS status Unsatisfiable for theBenchmark
% 182.83/30.84 % SZS output start Proof for theBenchmark
% See solution above
% 182.83/30.84 % (4250)------------------------------
% 182.83/30.84 % (4250)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 182.83/30.84 % (4250)Termination reason: Refutation
% 182.83/30.84
% 182.83/30.84 % (4250)Memory used [KB]: 185248
% 182.83/30.84 % (4250)Time elapsed: 30.433 s
% 182.83/30.84 % (4250)Instructions burned: 66339 (million)
% 182.83/30.84 % (4250)------------------------------
% 182.83/30.84 % (4250)------------------------------
% 182.83/30.84 % (4245)Success in time 30.484 s
%------------------------------------------------------------------------------