TSTP Solution File: LCL527+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n004.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 : Sun Jul 17 12:09:40 EDT 2022
% Result : Theorem 32.09s 4.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : LCL527+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n004.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 : 600
% 0.12/0.34 % DateTime : Sun Jul 3 14:21:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 32.09/4.55 % SZS status Theorem
% 32.09/4.55 % SZS output begin IncompleteProof
% 32.09/4.55 cnf(c0, axiom,
% 32.09/4.55 ~adjunction).
% 32.09/4.55 cnf(c1, plain,
% 32.09/4.55 ~adjunction,
% 32.09/4.55 inference(start, [], [c0])).
% 32.09/4.55
% 32.09/4.55 cnf(c2, axiom,
% 32.09/4.55 adjunction | ~is_a_theorem(and(sK58,sK59))).
% 32.09/4.55 cnf(c3, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [], [c1, c2])).
% 32.09/4.55 cnf(c4, plain,
% 32.09/4.55 ~is_a_theorem(and(sK58,sK59)),
% 32.09/4.55 inference(strict_predicate_extension, [], [c1, c2])).
% 32.09/4.55
% 32.09/4.55 cnf(c5, axiom,
% 32.09/4.55 is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens).
% 32.09/4.55 cnf(a0, assumption,
% 32.09/4.55 and(sK58,sK59) = X0).
% 32.09/4.55 cnf(c6, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 32.09/4.55 cnf(c7, plain,
% 32.09/4.55 ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 32.09/4.55
% 32.09/4.55 cnf(c8, axiom,
% 32.09/4.55 is_a_theorem(X2) | ~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens).
% 32.09/4.55 cnf(a1, assumption,
% 32.09/4.55 implies(X1,X0) = X2).
% 32.09/4.55 cnf(c9, plain,
% 32.09/4.55 ~is_a_theorem(X1) | ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 32.09/4.55 cnf(c10, plain,
% 32.09/4.55 ~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 32.09/4.55
% 32.09/4.55 cnf(c11, axiom,
% 32.09/4.55 is_a_theorem(implies(X4,implies(X5,and(X4,X5)))) | ~and_3).
% 32.09/4.55 cnf(a2, assumption,
% 32.09/4.55 implies(X3,X2) = implies(X4,implies(X5,and(X4,X5)))).
% 32.09/4.55 cnf(c12, plain,
% 32.09/4.55 ~is_a_theorem(X3) | ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])).
% 32.09/4.55 cnf(c13, plain,
% 32.09/4.55 ~and_3,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])).
% 32.09/4.55
% 32.09/4.55 cnf(c14, axiom,
% 32.09/4.55 and_3).
% 32.09/4.55 cnf(c15, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [], [c13, c14])).
% 32.09/4.55 cnf(c16, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [], [c13, c14])).
% 32.09/4.55
% 32.09/4.55 cnf(c17, axiom,
% 32.09/4.55 adjunction | is_a_theorem(sK58)).
% 32.09/4.55 cnf(a3, assumption,
% 32.09/4.55 X3 = sK58).
% 32.09/4.55 cnf(c18, plain,
% 32.09/4.55 ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])).
% 32.09/4.55 cnf(c19, plain,
% 32.09/4.55 adjunction,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])).
% 32.09/4.55
% 32.09/4.55 cnf(c20, plain,
% 32.09/4.55 ~adjunction).
% 32.09/4.55 cnf(c21, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(predicate_reduction, [], [c19, c20])).
% 32.09/4.55
% 32.09/4.55 cnf(c22, axiom,
% 32.09/4.55 modus_ponens).
% 32.09/4.55 cnf(c23, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [], [c18, c22])).
% 32.09/4.55 cnf(c24, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(strict_predicate_extension, [], [c18, c22])).
% 32.09/4.55
% 32.09/4.55 cnf(c25, axiom,
% 32.09/4.55 adjunction | is_a_theorem(sK59)).
% 32.09/4.55 cnf(a4, assumption,
% 32.09/4.55 X1 = sK59).
% 32.09/4.55 cnf(c26, plain,
% 32.09/4.55 ~modus_ponens,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a4])], [c9, c25])).
% 32.09/4.55 cnf(c27, plain,
% 32.09/4.55 adjunction,
% 32.09/4.55 inference(strict_predicate_extension, [assumptions([a4])], [c9, c25])).
% 32.09/4.55
% 32.09/4.55 cnf(c28, plain,
% 32.09/4.55 ~adjunction).
% 32.09/4.55 cnf(c29, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(predicate_reduction, [], [c27, c28])).
% 32.09/4.55
% 32.09/4.55 cnf(c30, plain,
% 32.09/4.55 modus_ponens).
% 32.09/4.55 cnf(c31, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(predicate_reduction, [], [c26, c30])).
% 32.09/4.55
% 32.09/4.55 cnf(c32, plain,
% 32.09/4.55 $false,
% 32.09/4.55 inference(constraint_solving, [
% 32.09/4.55 bind(X0, and(sK58,sK59)),
% 32.09/4.55 bind(X1, sK59),
% 32.09/4.55 bind(X2, implies(X1,X0)),
% 32.09/4.55 bind(X3, sK58),
% 32.09/4.55 bind(X4, sK58),
% 32.09/4.55 bind(X5, sK59)
% 32.09/4.55 ],
% 32.09/4.55 [a0, a1, a2, a3, a4])).
% 32.09/4.55
% 32.09/4.55 % SZS output end IncompleteProof
%------------------------------------------------------------------------------