TSTP Solution File: KRS166+1 by ConnectPP---0.3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : KRS166+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n029.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 : Mon Mar 25 14:18:14 EDT 2024

% Result   : Theorem 0.12s 0.34s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS166+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34  % Computer : n029.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  : 300
% 0.12/0.34  % DateTime : Thu Mar 21 02:54:03 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% 0.12/0.34  
% 0.12/0.34  % Formula: axiom_0 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(axiom_0-1, axiom, ( cowlThing(_u1) )).
% 0.12/0.34  cnf(axiom_0-2, axiom, ( ~cowlNothing(_u2) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: axiom_1 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(axiom_1-1, axiom, ( ~xsd_string(_u4) | ~xsd_integer(_u4) )).
% 0.12/0.34  cnf(axiom_1-2, axiom, ( xsd_integer(_u5) | xsd_string(_u5) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: axiom_2 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(axiom_2-1, axiom, ( ~cAutomobile(_u6) | cCar(_u6) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: axiom_3 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(axiom_3-1, axiom, ( ~cCar(_u7) | cAutomobile(_u7) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: the_axiom ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.34  cnf(the_axiom-1, negated_conjecture, ( ~cowlThing(skolem1) | cowlNothing(skolem1) | ~_def0 | ~_def1 | ~_def2 | ~_def3 )).
% 0.12/0.34  cnf(the_axiom-2, negated_conjecture, ( _def0 | xsd_string(skolem2) )).
% 0.12/0.34  cnf(the_axiom-3, negated_conjecture, ( _def0 | xsd_integer(skolem2) )).
% 0.12/0.34  cnf(the_axiom-4, negated_conjecture, ( _def1 | ~xsd_integer(skolem2) )).
% 0.12/0.34  cnf(the_axiom-5, negated_conjecture, ( _def1 | ~xsd_string(skolem2) )).
% 0.12/0.34  cnf(the_axiom-6, negated_conjecture, ( _def2 | cCar(skolem3) )).
% 0.12/0.34  cnf(the_axiom-7, negated_conjecture, ( _def2 | ~cAutomobile(skolem3) )).
% 0.12/0.34  cnf(the_axiom-8, negated_conjecture, ( _def3 | cAutomobile(skolem3) )).
% 0.12/0.34  cnf(the_axiom-9, negated_conjecture, ( _def3 | ~cCar(skolem3) )).
% 0.12/0.34  
% 0.12/0.34  % Problem matrix:
% 0.12/0.34  cnf(matrix-0, plain, ( cowlThing(_u1) )).
% 0.12/0.34  cnf(matrix-1, plain, ( ~cowlNothing(_u2) )).
% 0.12/0.34  cnf(matrix-2, plain, ( ~xsd_string(_u4) | ~xsd_integer(_u4) )).
% 0.12/0.34  cnf(matrix-3, plain, ( xsd_integer(_u5) | xsd_string(_u5) )).
% 0.12/0.34  cnf(matrix-4, plain, ( ~cAutomobile(_u6) | cCar(_u6) )).
% 0.12/0.34  cnf(matrix-5, plain, ( ~cCar(_u7) | cAutomobile(_u7) )).
% 0.12/0.34  cnf(matrix-6, plain, ( ~cowlThing(skolem1) | cowlNothing(skolem1) | ~_def0 | ~_def1 | ~_def2 | ~_def3 )).
% 0.12/0.34  cnf(matrix-7, plain, ( _def0 | xsd_string(skolem2) )).
% 0.12/0.34  cnf(matrix-8, plain, ( _def0 | xsd_integer(skolem2) )).
% 0.12/0.34  cnf(matrix-9, plain, ( _def1 | ~xsd_integer(skolem2) )).
% 0.12/0.34  cnf(matrix-10, plain, ( _def1 | ~xsd_string(skolem2) )).
% 0.12/0.34  cnf(matrix-11, plain, ( _def2 | cCar(skolem3) )).
% 0.12/0.34  cnf(matrix-12, plain, ( _def2 | ~cAutomobile(skolem3) )).
% 0.12/0.34  cnf(matrix-13, plain, ( _def3 | cAutomobile(skolem3) )).
% 0.12/0.34  cnf(matrix-14, plain, ( _def3 | ~cCar(skolem3) )).
% 0.12/0.34  
% 0.12/0.34  % Proof stack:
% 0.12/0.34  cnf(proof-stack, plain, 
% 0.12/0.34  proof_stack(
% 0.12/0.34  start(1), 
% 0.12/0.34  left_branch(0, 6, 1, 2), 
% 0.12/0.34  left_branch(0, 0, 0, 3), 
% 0.12/0.34  right_branch(3), 
% 0.12/0.34  left_branch(0, 12, 0, 4), 
% 0.12/0.34  left_branch(0, 5, 1, 5), 
% 0.12/0.34  left_branch(0, 11, 1, 6), 
% 0.12/0.34  reduction(0, 1), 
% 0.12/0.34  right_branch(6), 
% 0.12/0.34  right_branch(5), 
% 0.12/0.34  right_branch(4), 
% 0.12/0.34  left_branch(0, 10, 0, 5), 
% 0.12/0.34  left_branch(0, 3, 1, 6), 
% 0.12/0.34  left_branch(0, 9, 1, 7), 
% 0.12/0.34  reduction(0, 1), 
% 0.12/0.34  right_branch(7), 
% 0.12/0.34  right_branch(6), 
% 0.12/0.34  right_branch(5), 
% 0.12/0.34  left_branch(0, 8, 0, 6), 
% 0.12/0.34  left_branch(0, 2, 1, 7), 
% 0.12/0.34  left_branch(0, 7, 1, 8), 
% 0.12/0.34  reduction(0, 1), 
% 0.12/0.34  right_branch(8), 
% 0.12/0.34  right_branch(7), 
% 0.12/0.34  right_branch(6), 
% 0.12/0.34  left_branch(0, 14, 0, 7), 
% 0.12/0.34  left_branch(0, 4, 1, 8), 
% 0.12/0.34  left_branch(0, 13, 1, 9), 
% 0.12/0.34  reduction(0, 1), 
% 0.12/0.34  right_branch(9), 
% 0.12/0.34  right_branch(8), 
% 0.12/0.34  right_branch(7), 
% 0.12/0.34  right_branch(2)
% 0.12/0.34  )).
% 0.12/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------