TSTP Solution File: PUZ003-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n022.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:18:51 EDT 2022
% Result : Unsatisfiable 0.14s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun May 29 00:14:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % SZS status Unsatisfiable
% 0.14/0.35 % SZS output begin IncompleteProof
% 0.14/0.35 cnf(c0, axiom,
% 0.14/0.35 ~shaved(petruchio,lorenzo)).
% 0.14/0.35 cnf(c1, plain,
% 0.14/0.35 ~shaved(petruchio,lorenzo),
% 0.14/0.35 inference(start, [], [c0])).
% 0.14/0.35
% 0.14/0.35 cnf(c2, axiom,
% 0.14/0.35 shaved(X0,X1) | ~member(X0) | ~shaved(members,X1)).
% 0.14/0.35 cnf(a0, assumption,
% 0.14/0.35 petruchio = X0).
% 0.14/0.35 cnf(a1, assumption,
% 0.14/0.35 lorenzo = X1).
% 0.14/0.35 cnf(c3, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35 cnf(c4, plain,
% 0.14/0.35 ~member(X0) | ~shaved(members,X1),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35
% 0.14/0.35 cnf(c5, axiom,
% 0.14/0.35 member(petruchio)).
% 0.14/0.35 cnf(a2, assumption,
% 0.14/0.35 X0 = petruchio).
% 0.14/0.35 cnf(c6, plain,
% 0.14/0.35 ~shaved(members,X1),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.35 cnf(c7, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.35
% 0.14/0.35 cnf(c8, axiom,
% 0.14/0.35 shaved(members,X2) | ~shaved(X2,X3) | ~member(X3) | ~member(X2)).
% 0.14/0.35 cnf(a3, assumption,
% 0.14/0.35 members = members).
% 0.14/0.35 cnf(a4, assumption,
% 0.14/0.35 X1 = X2).
% 0.14/0.35 cnf(c9, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.14/0.35 cnf(c10, plain,
% 0.14/0.35 ~shaved(X2,X3) | ~member(X3) | ~member(X2),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.14/0.35
% 0.14/0.35 cnf(c11, axiom,
% 0.14/0.35 shaved(X4,X5) | ~member(X4) | ~shaved(members,X5)).
% 0.14/0.35 cnf(a5, assumption,
% 0.14/0.35 X2 = X4).
% 0.14/0.35 cnf(a6, assumption,
% 0.14/0.35 X3 = X5).
% 0.14/0.35 cnf(c12, plain,
% 0.14/0.35 ~member(X3) | ~member(X2),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.14/0.35 cnf(c13, plain,
% 0.14/0.35 ~member(X4) | ~shaved(members,X5),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.14/0.35
% 0.14/0.35 cnf(c14, axiom,
% 0.14/0.35 member(lorenzo)).
% 0.14/0.35 cnf(a7, assumption,
% 0.14/0.35 X4 = lorenzo).
% 0.14/0.35 cnf(c15, plain,
% 0.14/0.35 ~shaved(members,X5),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])).
% 0.14/0.35 cnf(c16, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])).
% 0.14/0.35
% 0.14/0.35 cnf(c17, axiom,
% 0.14/0.35 shaved(members,X6) | ~shaved(X6,X7) | ~member(X7) | ~member(X6)).
% 0.14/0.35 cnf(a8, assumption,
% 0.14/0.35 members = members).
% 0.14/0.35 cnf(a9, assumption,
% 0.14/0.35 X5 = X6).
% 0.14/0.35 cnf(c18, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c17])).
% 0.14/0.35 cnf(c19, plain,
% 0.14/0.35 ~shaved(X6,X7) | ~member(X7) | ~member(X6),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c17])).
% 0.14/0.35
% 0.14/0.35 cnf(c20, axiom,
% 0.14/0.35 shaved(guido,cesare)).
% 0.14/0.35 cnf(a10, assumption,
% 0.14/0.35 X6 = guido).
% 0.14/0.35 cnf(a11, assumption,
% 0.14/0.35 X7 = cesare).
% 0.14/0.35 cnf(c21, plain,
% 0.14/0.35 ~member(X7) | ~member(X6),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 0.14/0.35 cnf(c22, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 0.14/0.35
% 0.14/0.35 cnf(c23, axiom,
% 0.14/0.35 member(cesare)).
% 0.14/0.35 cnf(a12, assumption,
% 0.14/0.35 X7 = cesare).
% 0.14/0.35 cnf(c24, plain,
% 0.14/0.35 ~member(X6),
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 0.14/0.35 cnf(c25, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 0.14/0.35
% 0.14/0.35 cnf(c26, axiom,
% 0.14/0.35 member(guido)).
% 0.14/0.35 cnf(a13, assumption,
% 0.14/0.35 X6 = guido).
% 0.14/0.35 cnf(c27, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a13])], [c24, c26])).
% 0.14/0.35 cnf(c28, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(strict_predicate_extension, [assumptions([a13])], [c24, c26])).
% 0.14/0.35
% 0.14/0.35 cnf(c29, plain,
% 0.14/0.35 member(X6)).
% 0.14/0.35 cnf(a14, assumption,
% 0.14/0.35 X3 = X6).
% 0.14/0.35 cnf(c30, plain,
% 0.14/0.35 ~member(X2),
% 0.14/0.35 inference(predicate_reduction, [assumptions([a14])], [c12, c29])).
% 0.14/0.35
% 0.14/0.35 cnf(c31, plain,
% 0.14/0.35 member(X4)).
% 0.14/0.35 cnf(a15, assumption,
% 0.14/0.35 X2 = X4).
% 0.14/0.35 cnf(c32, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(predicate_reduction, [assumptions([a15])], [c30, c31])).
% 0.14/0.35
% 0.14/0.35 cnf(c33, plain,
% 0.14/0.35 $false,
% 0.14/0.35 inference(constraint_solving, [
% 0.14/0.35 bind(X0, petruchio),
% 0.14/0.35 bind(X1, lorenzo),
% 0.14/0.35 bind(X2, lorenzo),
% 0.14/0.35 bind(X3, guido),
% 0.14/0.35 bind(X4, lorenzo),
% 0.14/0.35 bind(X5, guido),
% 0.14/0.35 bind(X6, guido),
% 0.14/0.35 bind(X7, cesare)
% 0.14/0.35 ],
% 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.14/0.35
% 0.14/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------