TSTP Solution File: SYN951+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN951+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 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 : 600s
% DateTime : Thu Jul 21 08:14:21 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN951+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 12:29:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 sP1 | ~p(X0)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 sP1 | ~p(X0),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 ~q | sP0 | ~sP1).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 ~p(X0),
% 0.13/0.35 inference(strict_predicate_extension, [], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 ~q | sP0,
% 0.13/0.35 inference(strict_predicate_extension, [], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 q | sP0 | ~sP1).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 sP0,
% 0.13/0.35 inference(strict_predicate_extension, [], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 sP0 | ~sP1,
% 0.13/0.35 inference(strict_predicate_extension, [], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 b | ~sP0).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~sP1,
% 0.13/0.35 inference(strict_predicate_extension, [], [c7, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 b,
% 0.13/0.35 inference(strict_predicate_extension, [], [c7, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 ~b | ~sP0).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [], [c10, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 ~sP0,
% 0.13/0.35 inference(strict_predicate_extension, [], [c10, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 sP0).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 sP1).
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [], [c9, c16])).
% 0.13/0.35
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 ~sP0).
% 0.13/0.35 cnf(c19, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [], [c6, c18])).
% 0.13/0.35
% 0.13/0.35 cnf(c20, axiom,
% 0.13/0.35 p(sK2)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 X0 = sK2).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c3, c20])).
% 0.13/0.35 cnf(c22, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c3, c20])).
% 0.13/0.35
% 0.13/0.35 cnf(c23, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK2)
% 0.13/0.35 ],
% 0.13/0.35 [a0])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------