TSTP Solution File: SET115-7 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.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 : 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 02:43:58 EDT 2022
% Result : Unsatisfiable 6.26s 1.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 08:00:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.26/1.35 % SZS status Unsatisfiable
% 6.26/1.35 % SZS output begin IncompleteProof
% 6.26/1.35 cnf(c0, axiom,
% 6.26/1.35 x != unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x))))).
% 6.26/1.35 cnf(c1, plain,
% 6.26/1.35 x != unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),
% 6.26/1.35 inference(start, [], [c0])).
% 6.26/1.35
% 6.26/1.35 cnf(c2, axiom,
% 6.26/1.35 first(X0) = X0 | unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0).
% 6.26/1.35 cnf(a0, assumption,
% 6.26/1.35 unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))) = unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0))))).
% 6.26/1.35 cnf(c3, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 6.26/1.35 cnf(c4, plain,
% 6.26/1.35 first(X0) = X0,
% 6.26/1.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 6.26/1.35 cnf(c5, plain,
% 6.26/1.35 X1 != X0 | x != X1,
% 6.26/1.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 6.26/1.35
% 6.26/1.35 cnf(a1, assumption,
% 6.26/1.35 X1 = X0).
% 6.26/1.35 cnf(c6, plain,
% 6.26/1.35 x != X1,
% 6.26/1.35 inference(reflexivity, [assumptions([a1])], [c5])).
% 6.26/1.35
% 6.26/1.35 cnf(a2, assumption,
% 6.26/1.35 x = X1).
% 6.26/1.35 cnf(c7, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(reflexivity, [assumptions([a2])], [c6])).
% 6.26/1.35
% 6.26/1.35 cnf(c8, axiom,
% 6.26/1.35 x != first(x)).
% 6.26/1.35 cnf(a3, assumption,
% 6.26/1.35 first(x) = first(X0)).
% 6.26/1.35 cnf(c9, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 6.26/1.35 cnf(c10, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 6.26/1.35 cnf(c11, plain,
% 6.26/1.35 x != X0,
% 6.26/1.35 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 6.26/1.35
% 6.26/1.35 cnf(a4, assumption,
% 6.26/1.35 x = X0).
% 6.26/1.35 cnf(c12, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(reflexivity, [assumptions([a4])], [c11])).
% 6.26/1.35
% 6.26/1.35 cnf(c13, plain,
% 6.26/1.35 $false,
% 6.26/1.35 inference(constraint_solving, [
% 6.26/1.35 bind(X0, x),
% 6.26/1.35 bind(X1, x)
% 6.26/1.35 ],
% 6.26/1.35 [a0, a1, a2, a3, a4])).
% 6.26/1.35
% 6.26/1.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------