TSTP Solution File: PUZ012-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 : 600s
% DateTime : Mon Jul 18 18:27:15 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 03:10:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 115 clauses, backtracked 24 clauses, performed 4 splits and kept 102 clauses.
% 0.19/0.42 SPASS allocated 63168 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.42 0:00:00.04 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 7, length 47 :
% 0.19/0.42 % SZS output start Refutation
% 0.19/0.42 3[0:Inp] || contains(u,v)+ label(u,v)* -> .
% 0.19/0.42 4[0:Inp] || -> contains(boxc,u) contains(boxb,u) contains(boxa,u)*.
% 0.19/0.42 5[0:Inp] || -> contains(u,oranges) contains(u,bananas) contains(u,apples)*.
% 0.19/0.42 6[0:Inp] || contains(u,v)*+ contains(u,w)* -> equal_fruits(w,v)*.
% 0.19/0.42 7[0:Inp] || contains(u,v)*+ contains(w,v)* -> equal_boxes(w,u)*.
% 0.19/0.42 9[0:Inp] || equal_boxes(boxb,boxc)*+ -> .
% 0.19/0.42 11[0:Inp] || equal_fruits(apples,bananas)*+ -> .
% 0.19/0.42 13[0:Inp] || equal_fruits(apples,oranges)*+ -> .
% 0.19/0.42 14[0:Inp] || -> label(boxa,apples)*.
% 0.19/0.42 16[0:Inp] || -> label(boxc,bananas)*.
% 0.19/0.42 17[0:Inp] || -> contains(boxb,apples)*.
% 0.19/0.42 18[0:Inp] || contains(boxc,oranges)+ contains(boxa,bananas)* -> .
% 0.19/0.42 21[0:Res:5.2,3.0] || label(u,apples)*+ -> contains(u,oranges) contains(u,bananas).
% 0.19/0.42 23[0:Res:14.0,21.0] || -> contains(boxa,oranges) contains(boxa,bananas)*.
% 0.19/0.42 26[0:Res:5.2,7.0] || contains(u,apples)+ -> contains(v,oranges) contains(v,bananas) equal_boxes(u,v)*.
% 0.19/0.42 33[0:Res:17.0,6.0] || contains(boxb,u)+ -> equal_fruits(u,apples)*.
% 0.19/0.42 34[0:Res:23.1,6.0] || contains(boxa,u)+ -> contains(boxa,oranges) equal_fruits(u,bananas)*.
% 0.19/0.42 42[1:Spt:34.0,34.2] || contains(boxa,u)+ -> equal_fruits(u,bananas)*.
% 0.19/0.42 44[1:Res:4.2,42.0] || -> contains(boxc,u) contains(boxb,u) equal_fruits(u,bananas)*.
% 0.19/0.42 52[0:Res:17.0,26.0] || -> contains(u,oranges) contains(u,bananas) equal_boxes(boxb,u)*.
% 0.19/0.42 55[0:Res:52.2,9.0] || -> contains(boxc,oranges) contains(boxc,bananas)*.
% 0.19/0.42 59[0:Res:55.1,3.0] || label(boxc,bananas)* -> contains(boxc,oranges).
% 0.19/0.42 61[0:MRR:59.0,16.0] || -> contains(boxc,oranges)*.
% 0.19/0.42 62[0:MRR:18.0,61.0] || contains(boxa,bananas)*+ -> .
% 0.19/0.42 65[0:Res:61.0,6.0] || contains(boxc,u)+ -> equal_fruits(u,oranges)*.
% 0.19/0.42 68[0:Res:4.2,62.0] || -> contains(boxc,bananas) contains(boxb,bananas)*.
% 0.19/0.42 74[0:Res:68.1,33.0] || -> contains(boxc,bananas) equal_fruits(bananas,apples)*.
% 0.19/0.42 76[0:Res:68.1,6.0] || contains(boxb,u) -> contains(boxc,bananas) equal_fruits(u,bananas)*.
% 0.19/0.42 81[2:Spt:74.0] || -> contains(boxc,bananas)*.
% 0.19/0.42 85[2:Res:81.0,3.0] || label(boxc,bananas)* -> .
% 0.19/0.42 87[2:MRR:85.0,16.0] || -> .
% 0.19/0.42 89[2:Spt:87.0,74.0,81.0] || contains(boxc,bananas)*+ -> .
% 0.19/0.42 90[2:Spt:87.0,74.1] || -> equal_fruits(bananas,apples)*.
% 0.19/0.42 94[2:MRR:76.1,89.0] || contains(boxb,u) -> equal_fruits(u,bananas)*.
% 0.19/0.42 95[2:MRR:44.1,94.0] || -> contains(boxc,u) equal_fruits(u,bananas)*.
% 0.19/0.42 107[2:Res:95.1,11.0] || -> contains(boxc,apples)*.
% 0.19/0.42 124[2:Res:107.0,65.0] || -> equal_fruits(apples,oranges)*.
% 0.19/0.42 126[2:MRR:124.0,13.0] || -> .
% 0.19/0.42 127[1:Spt:126.0,34.1] || -> contains(boxa,oranges)*.
% 0.19/0.42 128[2:Spt:68.0] || -> contains(boxc,bananas)*.
% 0.19/0.42 134[2:Res:128.0,3.0] || label(boxc,bananas)* -> .
% 0.19/0.42 137[2:MRR:134.0,16.0] || -> .
% 0.19/0.42 138[2:Spt:137.0,68.0,128.0] || contains(boxc,bananas)*+ -> .
% 0.19/0.42 139[2:Spt:137.0,68.1] || -> contains(boxb,bananas)*.
% 0.19/0.42 143[2:MRR:76.1,138.0] || contains(boxb,u)+ -> equal_fruits(u,bananas)*.
% 0.19/0.42 154[2:Res:17.0,143.0] || -> equal_fruits(apples,bananas)*.
% 0.19/0.42 157[2:MRR:154.0,11.0] || -> .
% 0.19/0.42 % SZS output end Refutation
% 0.19/0.42 Formulae used in the proof : label_is_wrong each_thing_is_in_a_box each_box_contains_something contains_is_well_defined1 contains_is_well_defined2 boxb_not_boxc apples_not_bananas apples_not_oranges boxa_labelled_apples boxc_labelled_bananas boxb_contains_apples prove_boxa_contains_bananas_and_boxc_oranges
% 0.19/0.42
%------------------------------------------------------------------------------