TSTP Solution File: SWC365+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n023.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 : Tue Jul 19 21:08:27 EDT 2022
% Result : Theorem 149.42s 21.05s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 19:39:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 149.42/21.05 % SZS status Theorem
% 149.42/21.05 % SZS output begin IncompleteProof
% 149.42/21.05 cnf(c0, axiom,
% 149.42/21.05 sK89 = sK91).
% 149.42/21.05 cnf(c1, plain,
% 149.42/21.05 sK89 = sK91,
% 149.42/21.05 inference(start, [], [c0])).
% 149.42/21.05
% 149.42/21.05 cnf(c2, axiom,
% 149.42/21.05 ~rearsegP(sK89,sK88)).
% 149.42/21.05 cnf(a0, assumption,
% 149.42/21.05 sK89 = sK89).
% 149.42/21.05 cnf(a1, assumption,
% 149.42/21.05 sK91 = X0).
% 149.42/21.05 cnf(c3, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 149.42/21.05 cnf(c4, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 149.42/21.05 cnf(c5, plain,
% 149.42/21.05 ~rearsegP(X0,sK88),
% 149.42/21.05 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 149.42/21.05
% 149.42/21.05 cnf(c6, axiom,
% 149.42/21.05 sK88 = sK90).
% 149.42/21.05 cnf(a2, assumption,
% 149.42/21.05 sK88 = sK88).
% 149.42/21.05 cnf(c7, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 149.42/21.05 cnf(c8, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 149.42/21.05 cnf(c9, plain,
% 149.42/21.05 X1 != sK90 | ~rearsegP(X0,X1),
% 149.42/21.05 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 149.42/21.05
% 149.42/21.05 cnf(a3, assumption,
% 149.42/21.05 X1 = sK90).
% 149.42/21.05 cnf(c10, plain,
% 149.42/21.05 ~rearsegP(X0,X1),
% 149.42/21.05 inference(reflexivity, [assumptions([a3])], [c9])).
% 149.42/21.05
% 149.42/21.05 cnf(c11, axiom,
% 149.42/21.05 rearsegP(sK91,sK90) | ~neq(sK91,nil)).
% 149.42/21.05 cnf(a4, assumption,
% 149.42/21.05 X0 = sK91).
% 149.42/21.05 cnf(a5, assumption,
% 149.42/21.05 X1 = sK90).
% 149.42/21.05 cnf(c12, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 149.42/21.05 cnf(c13, plain,
% 149.42/21.05 ~neq(sK91,nil),
% 149.42/21.05 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 149.42/21.05
% 149.42/21.05 cnf(c14, axiom,
% 149.42/21.05 neq(sK89,nil)).
% 149.42/21.05 cnf(a6, assumption,
% 149.42/21.05 X2 = sK91).
% 149.42/21.05 cnf(a7, assumption,
% 149.42/21.05 X3 = nil).
% 149.42/21.05 cnf(c15, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 149.42/21.05 cnf(c16, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 149.42/21.05 cnf(c17, plain,
% 149.42/21.05 sK89 != X2 | nil != X3,
% 149.42/21.05 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 149.42/21.05
% 149.42/21.05 cnf(c18, plain,
% 149.42/21.05 sK89 = sK91).
% 149.42/21.05 cnf(a8, assumption,
% 149.42/21.05 sK89 = sK89).
% 149.42/21.05 cnf(a9, assumption,
% 149.42/21.05 sK91 = X4).
% 149.42/21.05 cnf(c19, plain,
% 149.42/21.05 nil != X3,
% 149.42/21.05 inference(equality_reduction, [assumptions([a8, a9])], [c17, c18])).
% 149.42/21.05 cnf(c20, plain,
% 149.42/21.05 X4 != X2,
% 149.42/21.05 inference(equality_reduction, [assumptions([a8, a9])], [c17, c18])).
% 149.42/21.05
% 149.42/21.05 cnf(a10, assumption,
% 149.42/21.05 X4 = X2).
% 149.42/21.05 cnf(c21, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(reflexivity, [assumptions([a10])], [c20])).
% 149.42/21.05
% 149.42/21.05 cnf(a11, assumption,
% 149.42/21.05 nil = X3).
% 149.42/21.05 cnf(c22, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(reflexivity, [assumptions([a11])], [c19])).
% 149.42/21.05
% 149.42/21.05 cnf(c23, plain,
% 149.42/21.05 $false,
% 149.42/21.05 inference(constraint_solving, [
% 149.42/21.05 bind(X0, sK91),
% 149.42/21.05 bind(X1, sK90),
% 149.42/21.05 bind(X2, sK91),
% 149.42/21.05 bind(X3, nil),
% 149.42/21.05 bind(X4, sK91)
% 149.42/21.05 ],
% 149.42/21.05 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 149.42/21.05
% 149.42/21.05 % SZS output end IncompleteProof
%------------------------------------------------------------------------------