↑ Up

Vampire---5.0.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL415-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:52:20 AM UTC 2026

% Result   : Satisfiable 0.22s 1.91s
% Output   : Saturation 0.22s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u12,axiom,
    ( is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)),implies(X1,X2))))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2)))) ) ).

cnf(u5,axiom,
    ( ~ is_a_theorem(implies(X1,implies(implies(X2,X0),X3)))
    | ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(implies(X0,X3)) ) ).

cnf(u15,axiom,
    ( is_a_theorem(implies(implies(implies(implies(X0,X1),X1),implies(implies(X0,X1),X1)),implies(X1,implies(implies(X0,X1),X1))))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X1),implies(X1,implies(implies(X0,X1),X1))))
    | ~ is_a_theorem(implies(implies(X0,X1),X1)) ) ).

cnf(u17,axiom,
    ( ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2))))
    | ~ is_a_theorem(implies(implies(X0,X1),X2))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)))
    | is_a_theorem(implies(X1,X2)) ) ).

cnf(u19,axiom,
    ( ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X1,X2)),implies(implies(X1,X2),implies(implies(X0,implies(X1,X2)),implies(X1,X2)))))
    | ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,X2)))
    | ~ is_a_theorem(implies(X2,implies(implies(implies(X0,implies(X1,X2)),implies(X1,X2)),implies(implies(X0,implies(X1,X2)),implies(X1,X2)))))
    | is_a_theorem(implies(X2,implies(implies(X0,implies(X1,X2)),implies(X1,X2)))) ) ).

cnf(u4,axiom,
    ( is_a_theorem(implies(implies(X1,implies(implies(X2,X0),X3)),implies(X0,X3)))
    | ~ is_a_theorem(implies(X0,X1)) ) ).

cnf(u14,axiom,
    ( is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)),implies(X1,X2)))
    | ~ is_a_theorem(implies(implies(X0,X1),X2))
    | ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2)))) ) ).

cnf(u7,axiom,
    ( ~ is_a_theorem(implies(X0,implies(X1,implies(implies(X2,implies(X3,X0)),X4))))
    | is_a_theorem(implies(X0,X4))
    | ~ is_a_theorem(implies(implies(X3,X0),X1)) ) ).

cnf(u6,axiom,
    ( ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X3)))
    | is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))) ) ).

cnf(u8,axiom,
    ( is_a_theorem(implies(implies(implies(X0,X1),implies(implies(X2,X1),X3)),implies(X1,implies(implies(X2,X1),X3))))
    | ~ is_a_theorem(implies(X1,implies(X0,X1))) ) ).

cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(X0)
    | is_a_theorem(X1) ) ).

cnf(u11,axiom,
    ( ~ is_a_theorem(implies(implies(X1,X0),implies(implies(X2,X0),X3)))
    | ~ is_a_theorem(implies(X0,implies(X1,X0)))
    | is_a_theorem(implies(X0,implies(implies(X2,X0),X3))) ) ).

cnf(u10,axiom,
    ( ~ is_a_theorem(implies(X1,implies(implies(X2,implies(X0,X1)),implies(implies(X3,implies(X0,X1)),X4))))
    | ~ is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X1))))
    | is_a_theorem(implies(X1,implies(implies(X3,implies(X0,X1)),X4))) ) ).

cnf(prove_required_property,negated_conjecture,
    ~ is_a_theorem(implies(a,implies(b,a))) ).

cnf(candidate,axiom,
    is_a_theorem(implies(implies(X0,X1),implies(implies(X1,implies(implies(X2,X0),X3)),implies(X0,X3)))) ).

cnf(u16,axiom,
    ( ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),X3),implies(implies(X1,X2),implies(implies(X0,implies(X1,X2)),X3))))
    | ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X2,implies(implies(implies(X0,implies(X1,X2)),X3),implies(implies(X0,implies(X1,X2)),X3))))
    | is_a_theorem(implies(X2,X3)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL415-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  % Computer : n026.cluster.edu
% 0.15/0.42  % Model    : x86_64 x86_64
% 0.15/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42  % Memory   : 8046.5625MB
% 0.15/0.42  % OS       : Linux 6.8.0-71-generic
% 0.15/0.42  % CPULimit : 300
% 0.15/0.42  % WCLimit  : 300
% 0.15/0.42  % DateTime : Sun Sep 27 15:43:26 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.43  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/1.91  % (3021098)Input is clausal, will run a generic CNF schedule.
% 0.22/1.91  % (3021107)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=674747117:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 0.22/1.91  % (3021112)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=441702474:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 0.22/1.91  % (3021106)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2910749494:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 0.22/1.91  % (3021112)Refutation not found, incomplete strategy
% 0.22/1.91  % (3021112)------------------------------
% 0.22/1.91  % (3021112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.91  % (3021112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.91  % (3021112)CaDiCaL version: 2.1.3
% 0.22/1.91  % (3021112)Termination reason: Refutation not found, incomplete strategy
% 0.22/1.91  % (3021112)Time elapsed: 0.002 s
% 0.22/1.91  % (3021112)Peak memory usage: 87 MB
% 0.22/1.91  % (3021112)Instructions burned: 2 (million)
% 0.22/1.91  % (3021113)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=128966616:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 0.22/1.91  % (3021114)dis-21_1_sil=8000:lcm=predicate:random_seed=2014586080:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 0.22/1.91  % (3021109)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3282902468:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 0.22/1.91  % (3021110)lrs+10_1_sil=8000:sp=occurrence:random_seed=1246144596:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 0.22/1.91  % (3021114)Also succeeded, but the first one will report.
% 0.22/1.91  % (3021110)First to succeed.
% 0.22/1.91  % (3021110)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3021098"
% 0.22/1.91  % (3021113)Instruction limit reached! 
% 0.22/1.91  % (3021113)------------------------------
% 0.22/1.91  % (3021113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.91  % (3021113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.91  % (3021113)CaDiCaL version: 2.1.3
% 0.22/1.91  % (3021113)Termination reason: Instruction limit
% 0.22/1.91  % (3021113)Termination phase: Saturation
% 0.22/1.91  % (3021113)Time elapsed: 0.147 s
% 0.22/1.91  % (3021113)Peak memory usage: 89 MB
% 0.22/1.91  % (3021113)Instructions burned: 180 (million)
% 0.22/1.91  % (3021112)------------------------------
% 0.22/1.91  % (3021112)------------------------------
% 0.22/1.91  % SZS status Satisfiable for theBenchmark
% 0.22/1.91  % SZS output start Saturation.
% See solution above
% 0.22/1.91  % SZS output start Definitions and Model Updates.
% 0.22/1.91  % SZS output end Definitions and Model Updates.
% 0.22/1.91  % (3021110)------------------------------
% 0.22/1.91  % (3021110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.91  % (3021110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.91  % (3021110)CaDiCaL version: 2.1.3
% 0.22/1.91  % (3021110)Termination reason: Satisfiable
% 0.22/1.91  % (3021110)Time elapsed: 0.004 s
% 0.22/1.91  % (3021110)Peak memory usage: 88 MB
% 0.22/1.91  % (3021110)Instructions burned: 2 (million)
% 0.22/1.91  % (3021110)------------------------------
% 0.22/1.91  % (3021110)------------------------------
% 0.22/1.91  % (3021098)Success in time 0.585 s
% 0.22/1.91  % Vampire exiting
%------------------------------------------------------------------------------