TSTP Solution File: PUZ024-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ024-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Nov 28 03:55:35 EST 2010
% Result : Unsatisfiable 31.00s
% Output : Refutation 31.00s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP23096/PUZ/PUZ024-1+noeq.car t=300 xo=off uct=32000
% CARINE version 0.734 (Dec 2003)
% Initializing tables ... done.
% Parsing .................... done.
% Calculating time slices ... done.
% Building Lookup Tables ... done.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 24] [nf = 0] [nu = 3] [ut = 7]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 180] [nf = 6] [nu = 45] [ut = 21]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 915] [nf = 54] [nu = 272] [ut = 29]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 4580] [nf = 424] [nu = 1216] [ut = 29]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 21948] [nf = 2515] [nu = 4517] [ut = 29]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 99129] [nf = 11991] [nu = 16533] [ut = 29]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 415136] [nf = 54096] [nu = 59793] [ut = 29]
% Looking for a proof at depth = 8 ...
% t = 4 secs [nr = 1648870] [nf = 226108] [nu = 211576] [ut = 29]
% Looking for a proof at depth = 9 ...
% t = 17 secs [nr = 6336252] [nf = 913559] [nu = 722149] [ut = 29]
% Looking for a proof at depth = 10 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 31 secs [nr = 11983705] [nf = 1727767] [nu = 1384024] [ut = 29]
% Looking for a proof at depth = 2 ...
% t = 31 secs [nr = 11983887] [nf = 1727773] [nu = 1384076] [ut = 29]
% Looking for a proof at depth = 3 ...
% t = 31 secs [nr = 11984682] [nf = 1727871] [nu = 1384303] [ut = 29]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~a_truth_1(truthteller_1(x0))
% B10: ~a_truth_1(says_2(x1,x0)) | ~a_truth_1(x0) | a_truth_1(truthteller_1(x1))
% B18: ~people_3(x0,x1,x2) | a_truth_1(all_are_liars_0()) | a_truth_1(truthteller_1(x0)) | a_truth_1(truthteller_1(x1)) | a_truth_1(truthteller_1(x2))
% Unit Clauses:
% --------------
% U0: < d0 v1 dv1 f1 c0 t2 td2 b nc > ~a_truth_1(truthteller_1(x0))
% U2: < d0 v0 dv0 f1 c2 t3 td2 b > a_truth_1(says_2(a_0(),all_are_liars_0()))
% U3: < d0 v0 dv0 f0 c3 t3 td1 b > people_3(b_0(),c_0(),a_0())
% U8: < d2 v0 dv0 f0 c1 t1 td1 > ~a_truth_1(all_are_liars_0())
% U34: < d4 v0 dv0 f1 c1 t2 td2 > a_truth_1(truthteller_1(a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% ~a_truth_1(truthteller_1(x0)) ....... U0
% Derivation of unit clause U2:
% a_truth_1(says_2(a_0(),all_are_liars_0())) ....... U2
% Derivation of unit clause U3:
% people_3(b_0(),c_0(),a_0()) ....... U3
% Derivation of unit clause U8:
% ~a_truth_1(truthteller_1(x0)) ....... B0
% ~a_truth_1(says_2(x1,x0)) | ~a_truth_1(x0) | a_truth_1(truthteller_1(x1)) ....... B10
% ~a_truth_1(says_2(x0, x1)) | ~a_truth_1(x1) ....... R1 [B0:L0, B10:L2]
% a_truth_1(says_2(a_0(),all_are_liars_0())) ....... U2
% ~a_truth_1(all_are_liars_0()) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U34:
% ~a_truth_1(truthteller_1(x0)) ....... B0
% ~people_3(x0,x1,x2) | a_truth_1(all_are_liars_0()) | a_truth_1(truthteller_1(x0)) | a_truth_1(truthteller_1(x1)) | a_truth_1(truthteller_1(x2)) ....... B18
% ~people_3(x0, x1, x2) | a_truth_1(all_are_liars_0()) | a_truth_1(truthteller_1(x1)) | a_truth_1(truthteller_1(x2)) ....... R1 [B0:L0, B18:L2]
% people_3(b_0(),c_0(),a_0()) ....... U3
% a_truth_1(all_are_liars_0()) | a_truth_1(truthteller_1(c_0())) | a_truth_1(truthteller_1(a_0())) ....... R2 [R1:L0, U3:L0]
% ~a_truth_1(all_are_liars_0()) ....... U8
% a_truth_1(truthteller_1(c_0())) | a_truth_1(truthteller_1(a_0())) ....... R3 [R2:L0, U8:L0]
% ~a_truth_1(truthteller_1(x0)) ....... U0
% a_truth_1(truthteller_1(a_0())) ....... R4 [R3:L0, U0:L0]
% Derivation of the empty clause:
% a_truth_1(truthteller_1(a_0())) ....... U34
% ~a_truth_1(truthteller_1(x0)) ....... U0
% [] ....... R1 [U34:L0, U0:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 13713344
% resolvents: 11985437 factors: 1727907
% Number of unit clauses generated: 1384524
% % unit clauses generated to total clauses generated: 10.10
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 6 [1] = 1 [2] = 14 [3] = 8
% [4] = 6
% Total = 35
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1384524 [2] = 6100535 [3] = 6228155 [4] = 130
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] a_truth_1 (+)6 (-)22
% [1] people_3 (+)3 (-)4
% ------------------
% Total: (+)9 (-)26
% Total number of unit clauses retained: 35
% Number of clauses skipped because of their length: 17835184
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 13713350
% Number of unification failures: 26797111
% Number of unit to unit unification failures: 122
% N literal unification failure due to lookup root_id table: 113491460
% N base clause resolution failure due to lookup table: 7022794
% N UC-BCL resolution dropped due to lookup table: 1764233
% Max entries in substitution set: 14
% N unit clauses dropped because they exceeded max values: 978291
% N unit clauses dropped because too much nesting: 0
% N unit clauses not constrcuted because table was full: 0
% N unit clauses dropped because UCFA table was full: 0
% Max number of terms in a unit clause: 5
% Max term depth in a unit clause: 3
% Number of states in UCFA table: 40
% Total number of terms of all unit clauses in table: 115
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.35
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 40510461
% ConstructUnitClause() = 978320
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 1.10 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 442366
% | |
% --------------------------------------------------------
% Elapsed time: 31 secs
% CPU time: 31.00 secs
%
%------------------------------------------------------------------------------