↑ Up

Vampire-SAT---5.0.1.SAT-Sat.s

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

% Computer : n014.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 12:09:00 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u9,axiom,
    true = ifeq2(eventuality(X0,X1),true,thing(X0,X1),true) ).

cnf(u102,negated_conjecture,
    true = agent(skc5,skc6,skc9) ).

cnf(u19,axiom,
    true = ifeq2(street(X0,X1),true,way(X0,X1),true) ).

cnf(u191,negated_conjecture,
    true = abstraction(skc5,skc8) ).

cnf(u104,axiom,
    b = ifeq(tuple(specific(X0,X1),general(X0,X1)),tuple(true,true),a,b) ).

cnf(u37,axiom,
    true = ifeq2(object(X0,X1),true,unisex(X0,X1),true) ).

cnf(u65,axiom,
    true = ifeq2(transport(X0,X1),true,instrumentality(X0,X1),true) ).

cnf(u47,axiom,
    true = ifeq2(abstraction(X0,X1),true,nonhuman(X0,X1),true) ).

cnf(u262,negated_conjecture,
    b = ifeq(tuple(specific(skc5,skc8),true),tuple(true,true),a,b) ).

cnf(u80,negated_conjecture,
    true = street(skc5,skc7) ).

cnf(u205,negated_conjecture,
    true = nonhuman(skc5,skc8) ).

cnf(u254,negated_conjecture,
    true = artifact(skc5,skc9) ).

cnf(u215,negated_conjecture,
    true = unisex(skc5,skc8) ).

cnf(u139,negated_conjecture,
    true = artifact(skc5,skc7) ).

cnf(u217,negated_conjecture,
    true = ifeq2(object(skc5,skc8),true,true,true) ).

cnf(u27,axiom,
    true = ifeq2(entity(X0,X1),true,thing(X0,X1),true) ).

cnf(u227,negated_conjecture,
    true = location(skc5,skc7) ).

cnf(u45,axiom,
    true = ifeq2(abstraction(X0,X1),true,thing(X0,X1),true) ).

cnf(u245,negated_conjecture,
    true = transport(skc5,skc9) ).

cnf(u55,axiom,
    true = ifeq2(city(X0,X1),true,location(X0,X1),true) ).

cnf(u57,axiom,
    true = ifeq2(location(X0,X1),true,object(X0,X1),true) ).

cnf(u178,negated_conjecture,
    true = unisex(skc5,skc7) ).

cnf(u209,negated_conjecture,
    true = general(skc5,skc8) ).

cnf(u113,negated_conjecture,
    true = eventuality(skc5,skc6) ).

cnf(u253,negated_conjecture,
    true = ifeq2(instrumentality(skc5,skc7),true,true,true) ).

cnf(u202,negated_conjecture,
    true = singleton(skc5,skc8) ).

cnf(u135,negated_conjecture,
    true = way(skc5,skc7) ).

cnf(u366,negated_conjecture,
    true = singleton(skc5,skc9) ).

cnf(u76,negated_conjecture,
    true = hollywood_placename(skc5,skc8) ).

cnf(u121,negated_conjecture,
    true = singleton(skc5,skc6) ).

cnf(u86,negated_conjecture,
    true = dirty(skc5,skc9) ).

cnf(ifeq_axiom_002,axiom,
    ifeq(X0,X0,X1,X2) = X1 ).

cnf(u88,negated_conjecture,
    true = old(skc5,skc9) ).

cnf(u21,axiom,
    true = ifeq2(way(X0,X1),true,artifact(X0,X1),true) ).

cnf(u276,negated_conjecture,
    true = impartial(skc5,skc9) ).

cnf(u98,negated_conjecture,
    true = down(skc5,skc6,skc7) ).

cnf(u31,axiom,
    true = ifeq2(entity(X0,X1),true,existent(X0,X1),true) ).

cnf(u265,negated_conjecture,
    b = ifeq(tuple(true,existent(skc5,skc6)),tuple(true,true),a,b) ).

cnf(u275,negated_conjecture,
    true = nonliving(skc5,skc9) ).

cnf(u258,negated_conjecture,
    true = object(skc5,skc9) ).

cnf(u84,negated_conjecture,
    true = white(skc5,skc9) ).

cnf(u173,negated_conjecture,
    true = impartial(skc5,skc7) ).

cnf(u94,negated_conjecture,
    true = event(skc5,skc6) ).

cnf(u11,axiom,
    true = ifeq2(thing(X0,X1),true,singleton(X0,X1),true) ).

cnf(u183,negated_conjecture,
    true = relname(skc5,skc8) ).

cnf(u96,negated_conjecture,
    true = of(skc5,skc8,skc7) ).

cnf(u29,axiom,
    true = ifeq2(entity(X0,X1),true,specific(X0,X1),true) ).

cnf(u106,axiom,
    b = ifeq(tuple(nonexistent(X0,X1),existent(X0,X1)),tuple(true,true),a,b) ).

cnf(u39,axiom,
    true = ifeq2(placename(X0,X1),true,relname(X0,X1),true) ).

cnf(u67,axiom,
    true = ifeq2(instrumentality(X0,X1),true,artifact(X0,X1),true) ).

cnf(u41,axiom,
    true = ifeq2(relname(X0,X1),true,relation(X0,X1),true) ).

cnf(u196,negated_conjecture,
    true = ifeq2(abstraction(skc5,skc7),true,true,true) ).

cnf(u241,negated_conjecture,
    true = vehicle(skc5,skc9) ).

cnf(u51,axiom,
    true = ifeq2(abstraction(X0,X1),true,unisex(X0,X1),true) ).

cnf(u283,negated_conjecture,
    ifeq3(of(skc5,X0,skc7),true,ifeq3(of(skc5,X1,skc7),true,ifeq3(placename(skc5,X0),true,ifeq3(placename(skc5,X1),true,X0,X1),X1),X1),X1) = X1 ).

cnf(u327,negated_conjecture,
    skc8 = ifeq3(of(skc5,X0,skc9),true,ifeq3(of(skc5,skc8,skc9),true,ifeq3(placename(skc5,X0),true,X0,skc8),skc8),skc8) ).

cnf(u329,negated_conjecture,
    skc8 = ifeq3(of(skc5,skc8,X0),true,ifeq3(of(skc5,skc8,X0),true,ifeq3(entity(skc5,X0),true,skc8,skc8),skc8),skc8) ).

cnf(u266,negated_conjecture,
    b = ifeq(tuple(nonexistent(skc5,skc7),true),tuple(true,true),a,b) ).

cnf(u100,negated_conjecture,
    true = in(skc5,skc6,skc7) ).

cnf(u284,negated_conjecture,
    skc8 = ifeq3(of(skc5,X0,X1),true,ifeq3(of(skc5,skc8,X1),true,ifeq3(placename(skc5,X0),true,ifeq3(entity(skc5,X1),true,X0,skc8),skc8),skc8),skc8) ).

cnf(u237,negated_conjecture,
    true = car(skc5,skc9) ).

cnf(u294,negated_conjecture,
    skc8 = ifeq3(of(skc5,X0,skc7),true,ifeq3(placename(skc5,X0),true,X0,skc8),skc8) ).

cnf(u53,axiom,
    true = ifeq2(hollywood_placename(X0,X1),true,placename(X0,X1),true) ).

cnf(u49,axiom,
    true = ifeq2(abstraction(X0,X1),true,general(X0,X1),true) ).

cnf(u340,negated_conjecture,
    true = ifeq2(abstraction(skc5,skc9),true,true,true) ).

cnf(u249,negated_conjecture,
    true = instrumentality(skc5,skc9) ).

cnf(u59,axiom,
    true = ifeq2(chevy(X0,X1),true,car(X0,X1),true) ).

cnf(u131,negated_conjecture,
    true = unisex(skc5,skc6) ).

cnf(u149,negated_conjecture,
    true = entity(skc5,skc7) ).

cnf(u70,negated_conjecture,
    true = actual_world(skc5) ).

cnf(u342,negated_conjecture,
    true = ifeq2(eventuality(skc5,skc9),true,true,true) ).

cnf(u72,negated_conjecture,
    true = chevy(skc5,skc9) ).

cnf(u5,axiom,
    true = ifeq2(barrel(X0,X1),true,event(X0,X1),true) ).

cnf(u161,negated_conjecture,
    true = singleton(skc5,skc7) ).

cnf(u82,negated_conjecture,
    true = lonely(skc5,skc7) ).

cnf(u15,axiom,
    true = ifeq2(eventuality(X0,X1),true,nonexistent(X0,X1),true) ).

cnf(u177,negated_conjecture,
    true = ifeq2(object(skc5,skc6),true,true,true) ).

cnf(u17,axiom,
    true = ifeq2(eventuality(X0,X1),true,unisex(X0,X1),true) ).

cnf(u260,negated_conjecture,
    b = ifeq(tuple(true,general(skc5,skc6)),tuple(true,true),a,b) ).

cnf(u304,negated_conjecture,
    true = existent(skc5,skc9) ).

cnf(u277,negated_conjecture,
    true = unisex(skc5,skc9) ).

cnf(u43,axiom,
    true = ifeq2(relation(X0,X1),true,abstraction(X0,X1),true) ).

cnf(u157,negated_conjecture,
    true = specific(skc5,skc7) ).

cnf(u78,negated_conjecture,
    true = city(skc5,skc7) ).

cnf(u123,negated_conjecture,
    true = specific(skc5,skc6) ).

cnf(u267,negated_conjecture,
    true = ifeq2(location(skc5,skc9),true,true,true) ).

cnf(u74,negated_conjecture,
    true = placename(skc5,skc8) ).

cnf(u13,axiom,
    true = ifeq2(eventuality(X0,X1),true,specific(X0,X1),true) ).

cnf(u169,negated_conjecture,
    true = nonliving(skc5,skc7) ).

cnf(u90,negated_conjecture,
    true = barrel(skc5,skc6) ).

cnf(u23,axiom,
    true = ifeq2(artifact(X0,X1),true,object(X0,X1),true) ).

cnf(u25,axiom,
    true = ifeq2(object(X0,X1),true,entity(X0,X1),true) ).

cnf(u35,axiom,
    true = ifeq2(object(X0,X1),true,impartial(X0,X1),true) ).

cnf(u257,negated_conjecture,
    true = ifeq2(way(skc5,skc9),true,true,true) ).

cnf(u164,negated_conjecture,
    true = existent(skc5,skc7) ).

cnf(ifeq_axiom_001,axiom,
    ifeq2(X0,X0,X1,X2) = X1 ).

cnf(u63,axiom,
    true = ifeq2(vehicle(X0,X1),true,transport(X0,X1),true) ).

cnf(u285,negated_conjecture,
    ifeq3(of(skc5,skc8,X0),true,ifeq3(of(skc5,X1,X0),true,ifeq3(placename(skc5,X1),true,ifeq3(entity(skc5,X0),true,skc8,X1),X1),X1),X1) = X1 ).

cnf(u295,negated_conjecture,
    ifeq3(of(skc5,X0,skc7),true,ifeq3(placename(skc5,X0),true,skc8,X0),X0) = X0 ).

cnf(u378,negated_conjecture,
    b = ifeq(tuple(true,general(skc5,skc9)),tuple(true,true),a,b) ).

cnf(u201,negated_conjecture,
    true = ifeq2(eventuality(skc5,skc8),true,true,true) ).

cnf(u199,negated_conjecture,
    true = ifeq2(entity(skc5,skc8),true,true,true) ).

cnf(u187,negated_conjecture,
    true = relation(skc5,skc8) ).

cnf(u33,axiom,
    true = ifeq2(object(X0,X1),true,nonliving(X0,X1),true) ).

cnf(u150,negated_conjecture,
    true = ifeq2(entity(skc5,skc6),true,true,true) ).

cnf(u154,negated_conjecture,
    true = thing(skc5,skc7) ).

cnf(u61,axiom,
    true = ifeq2(car(X0,X1),true,vehicle(X0,X1),true) ).

cnf(u143,negated_conjecture,
    true = object(skc5,skc7) ).

cnf(u117,negated_conjecture,
    true = thing(skc5,skc6) ).

cnf(u303,negated_conjecture,
    true = specific(skc5,skc9) ).

cnf(u127,negated_conjecture,
    true = nonexistent(skc5,skc6) ).

cnf(u305,negated_conjecture,
    ifeq3(of(skc5,X0,skc9),true,ifeq3(of(skc5,X1,skc9),true,ifeq3(placename(skc5,X0),true,ifeq3(placename(skc5,X1),true,X0,X1),X1),X1),X1) = X1 ).

cnf(u349,negated_conjecture,
    ifeq3(of(skc5,skc8,skc9),true,ifeq3(of(skc5,X0,skc9),true,ifeq3(placename(skc5,X0),true,skc8,X0),X0),X0) = X0 ).

cnf(ifeq_axiom,axiom,
    ifeq3(X0,X0,X1,X2) = X1 ).

cnf(u160,negated_conjecture,
    true = ifeq2(eventuality(skc5,skc7),true,true,true) ).

cnf(clause35,axiom,
    ifeq3(of(X0,X1,X2),true,ifeq3(of(X0,X3,X2),true,ifeq3(placename(X0,X1),true,ifeq3(placename(X0,X3),true,ifeq3(entity(X0,X2),true,X1,X3),X3),X3),X3),X3) = X3 ).

cnf(u195,negated_conjecture,
    true = ifeq2(abstraction(skc5,skc6),true,true,true) ).

cnf(u371,negated_conjecture,
    skc8 = ifeq3(of(skc5,skc8,skc9),true,ifeq3(of(skc5,skc8,skc9),true,skc8,skc8),skc8) ).

cnf(u274,negated_conjecture,
    true = entity(skc5,skc9) ).

cnf(u302,negated_conjecture,
    true = thing(skc5,skc9) ).

cnf(u261,negated_conjecture,
    b = ifeq(tuple(true,general(skc5,skc7)),tuple(true,true),a,b) ).

cnf(u382,negated_conjecture,
    b = ifeq(tuple(nonexistent(skc5,skc9),true),tuple(true,true),a,b) ).

cnf(goal,negated_conjecture,
    a != b ).

cnf(u197,negated_conjecture,
    true = thing(skc5,skc8) ).

cnf(u7,axiom,
    true = ifeq2(event(X0,X1),true,eventuality(X0,X1),true) ).

cnf(u92,negated_conjecture,
    true = present(skc5,skc6) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NLP129-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n014.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 18:07:17 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.45  % (1078997)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (1079006)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=312647406:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45  % (1079003)% WARNING: option uhcvi not known.
% 0.11/0.45  % (1079002)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=689063180_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45  % (1079004)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2706822949:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45  % (1079005)dis+10_1_sil=32000:sp=arity:random_seed=2916887001:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45  % (1079007)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2987771884:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45  % (1079008)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=423810781:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (1079006) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1078997-1079006"...
% 0.11/0.45  % (1079003)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=335887814:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45  % (1079006)...printing done.
% 0.11/0.45  % SZS status Satisfiable for theBenchmark
% 0.11/0.45  % SZS output start Saturation.
% See solution above
% 0.11/0.45  % SZS output start Definitions and Model Updates.
% 0.11/0.45  % SZS output end Definitions and Model Updates.
% 0.11/0.45  % (1079006)------------------------------
% 0.11/0.45  % (1079006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (1079006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (1079006)CaDiCaL version: 2.1.3
% 0.11/0.45  % (1079006)Termination reason: Satisfiable
% 0.11/0.45  % (1079006)Time elapsed: 0.008 s
% 0.11/0.45  % (1079006)Peak memory usage: 11 MB
% 0.11/0.45  % (1079006)Instructions burned: 24 (million)
% 0.11/0.45  % (1078997)Success in time 0.036 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------