TSTP Solution File: PUZ016-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PUZ016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 : Sun May 5 08:49:35 EDT 2024
% Result : Unsatisfiable 0.15s 0.35s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 14
% Syntax : Number of formulae : 44 ( 42 unt; 0 def)
% Number of atoms : 46 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-8 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1630,plain,
$false,
inference(subsumption_resolution,[],[f1629,f23]) ).
fof(f23,plain,
~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(unit_resulting_resolution,[],[f21,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X6,X7,X4,X5] :
( ~ achievable(row(X0),squares(X7,not_covered,not_covered,X2,X3,X4,X5,X6))
| achievable(row(X0),squares(X7,covered,covered,X2,X3,X4,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_2_and_3) ).
fof(f21,axiom,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_row_8_can_be_covered) ).
fof(f1629,plain,
achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f1628,f15]) ).
fof(f15,axiom,
successor(n7) = n8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_7_is_8) ).
fof(f1628,plain,
achievable(row(successor(n7)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f1627,f17]) ).
fof(f17,axiom,
not_covered = complement(covered),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_covered_is_not_covered) ).
fof(f1627,plain,
achievable(row(successor(n7)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f1621,f18]) ).
fof(f18,axiom,
covered = complement(not_covered),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_not_covered_is_covered) ).
fof(f1621,plain,
achievable(row(successor(n7)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(unit_resulting_resolution,[],[f1127,f8]) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ achievable(row(X0),squares(X7,X8,X1,X2,X3,X4,X5,X6))
| achievable(row(successor(X0)),squares(complement(X7),complement(X8),complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_vertical_pieces) ).
fof(f1127,plain,
achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f1126,f14]) ).
fof(f14,axiom,
successor(n6) = n7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_6_is_7) ).
fof(f1126,plain,
achievable(row(successor(n6)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f1125,f18]) ).
fof(f1125,plain,
achievable(row(successor(n6)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f1122,f17]) ).
fof(f1122,plain,
achievable(row(successor(n6)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(unit_resulting_resolution,[],[f735,f8]) ).
fof(f735,plain,
achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f734,f13]) ).
fof(f13,axiom,
successor(n5) = n6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_5_is_6) ).
fof(f734,plain,
achievable(row(successor(n5)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f733,f17]) ).
fof(f733,plain,
achievable(row(successor(n5)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f727,f18]) ).
fof(f727,plain,
achievable(row(successor(n5)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(unit_resulting_resolution,[],[f441,f8]) ).
fof(f441,plain,
achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f440,f12]) ).
fof(f12,axiom,
successor(n4) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_4_is_5) ).
fof(f440,plain,
achievable(row(successor(n4)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f439,f18]) ).
fof(f439,plain,
achievable(row(successor(n4)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f436,f17]) ).
fof(f436,plain,
achievable(row(successor(n4)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(unit_resulting_resolution,[],[f269,f8]) ).
fof(f269,plain,
achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f268,f11]) ).
fof(f11,axiom,
successor(n3) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_3_is_4) ).
fof(f268,plain,
achievable(row(successor(n3)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f267,f17]) ).
fof(f267,plain,
achievable(row(successor(n3)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f261,f18]) ).
fof(f261,plain,
achievable(row(successor(n3)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(unit_resulting_resolution,[],[f197,f8]) ).
fof(f197,plain,
achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f196,f10]) ).
fof(f10,axiom,
successor(n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_2_is_3) ).
fof(f196,plain,
achievable(row(successor(n2)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f195,f18]) ).
fof(f195,plain,
achievable(row(successor(n2)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(forward_demodulation,[],[f192,f17]) ).
fof(f192,plain,
achievable(row(successor(n2)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
inference(unit_resulting_resolution,[],[f159,f8]) ).
fof(f159,plain,
achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f158,f9]) ).
fof(f9,axiom,
successor(n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_1_is_2) ).
fof(f158,plain,
achievable(row(successor(n1)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f157,f19]) ).
fof(f19,axiom,
not_covered = complement(removed),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_removed_is_not_covered) ).
fof(f157,plain,
achievable(row(successor(n1)),squares(covered,complement(removed),complement(removed),covered,covered,covered,covered,covered)),
inference(forward_demodulation,[],[f113,f18]) ).
fof(f113,plain,
achievable(row(successor(n1)),squares(complement(not_covered),complement(removed),complement(removed),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
inference(unit_resulting_resolution,[],[f20,f8]) ).
fof(f20,axiom,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',first_row_initially) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : PUZ016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n019.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 18:01:53 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % (15099)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.31 % (15102)WARNING: value z3 for option sas not known
% 0.15/0.32 % (15100)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % (15101)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32 % (15103)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32 % (15106)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.15/0.32 % (15104)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.15/0.32 % (15105)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.15/0.32 % (15102)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.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 TRYING [2]
% 0.15/0.34 % (15106)First to succeed.
% 0.15/0.34 % (15106)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15099"
% 0.15/0.35 % (15106)Refutation found. Thanks to Tanya!
% 0.15/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.35 % (15106)------------------------------
% 0.15/0.35 % (15106)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.35 % (15106)Termination reason: Refutation
% 0.15/0.35
% 0.15/0.35 % (15106)Memory used [KB]: 996
% 0.15/0.35 % (15106)Time elapsed: 0.029 s
% 0.15/0.35 % (15106)Instructions burned: 62 (million)
% 0.15/0.35 % (15099)Success in time 0.045 s
%------------------------------------------------------------------------------