%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV289-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art01.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 06:50:04 EST 2010 % Result : GaveUp 0.47s % Output : None % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----NO SOLUTION OUTPUT BY SYSTEM %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % Command entered: % /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP29072/SWV/SWV289-2+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 = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 10 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 11 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 12 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 13 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 14 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 15 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 16 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 17 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 18 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 19 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 20 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 21 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 22 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 23 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 24 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 25 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 26 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 27 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 28 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 29 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 30 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 10 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 11 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 12 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 13 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 14 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 15 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 16 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 17 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 18 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 19 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 20 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 21 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 22 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 23 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 24 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 25 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 26 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 27 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 28 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 29 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % Looking for a proof at depth = 30 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 7] % GIVE UP! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 0 % resolvents: 0 factors: 0 % Number of unit clauses generated: 0 % % unit clauses generated to total clauses generated: nan % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 % Total = 7 % Number of generated clauses having [x] literals: % ------------------------------------------------ % Average size of a generated clause: nan % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)4 (-)3 % ------------------ % Total: (+)4 (-)3 % Total number of unit clauses retained: 7 % Number of clauses skipped because of their length: 0 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 0 % Number of unification failures: 0 % Number of unit to unit unification failures: 12 % N literal unification failure due to lookup root_id table: 0 % N base clause resolution failure due to lookup table: 0 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 0 % N unit clauses dropped because they exceeded max values: 0 % 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: 29 % Max term depth in a unit clause: 11 % Number of states in UCFA table: 73 % Total number of terms of all unit clauses in table: 75 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.97 % Number of symbols (columns) in UCFA: 62 % Profile 2: Number of calls to: % ============================== % PTUnify() = 0 % ConstructUnitClause() = 0 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: nan % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.45 secs % %------------------------------------------------------------------------------