TSTP Solution File: SYN083+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN083+1 : TPTP v8.1.0. Released v2.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 : n018.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:08:00 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n018.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 : Tue Jul 12 08:51:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output begin IncompleteProof
% 0.12/0.35 cnf(c0, axiom,
% 0.12/0.35 f(sK0,f(sK1,f(sK2,sK3))) != f(f(f(sK0,sK1),sK2),sK3)).
% 0.12/0.35 cnf(c1, plain,
% 0.12/0.35 f(sK0,f(sK1,f(sK2,sK3))) != f(f(f(sK0,sK1),sK2),sK3),
% 0.12/0.35 inference(start, [], [c0])).
% 0.12/0.35
% 0.12/0.35 cnf(c2, axiom,
% 0.12/0.35 f(X0,f(X1,X2)) = f(f(X0,X1),X2)).
% 0.12/0.35 cnf(a0, assumption,
% 0.12/0.35 f(f(f(sK0,sK1),sK2),sK3) = f(f(X0,X1),X2)).
% 0.12/0.35 cnf(c3, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35 cnf(c4, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35 cnf(c5, plain,
% 0.12/0.35 X3 != f(X0,f(X1,X2)) | f(sK0,f(sK1,f(sK2,sK3))) != X3,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35
% 0.12/0.35 cnf(c6, axiom,
% 0.12/0.35 f(X4,f(X5,X6)) = f(f(X4,X5),X6)).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 f(X0,f(X1,X2)) = f(f(X4,X5),X6)).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 f(sK0,f(sK1,f(sK2,sK3))) != X3,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.35 cnf(c8, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.35 cnf(c9, plain,
% 0.12/0.35 X7 != f(X4,f(X5,X6)) | X3 != X7,
% 0.12/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.35
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 X7 = f(X4,f(X5,X6))).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 X3 != X7,
% 0.12/0.35 inference(reflexivity, [assumptions([a2])], [c9])).
% 0.12/0.35
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 X3 = X7).
% 0.12/0.35 cnf(c11, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(reflexivity, [assumptions([a3])], [c10])).
% 0.12/0.35
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 f(sK0,f(sK1,f(sK2,sK3))) = X3).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(reflexivity, [assumptions([a4])], [c7])).
% 0.12/0.35
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, f(sK0,sK1)),
% 0.12/0.35 bind(X1, sK2),
% 0.12/0.35 bind(X2, sK3),
% 0.12/0.35 bind(X3, f(X4,f(X5,X6))),
% 0.12/0.35 bind(X4, sK0),
% 0.12/0.35 bind(X5, sK1),
% 0.12/0.35 bind(X6, f(X1,X2)),
% 0.12/0.35 bind(X7, f(X4,f(X5,X6)))
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------