TSTP Solution File: SWC131+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC131+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 : n012.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:07:18 EDT 2022
% Result : Theorem 20.00s 3.04s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC131+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.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 19:43:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 20.00/3.04 % SZS status Theorem
% 20.00/3.04 % SZS output begin IncompleteProof
% 20.00/3.04 cnf(c0, axiom,
% 20.00/3.04 ~neq(sK91,nil)).
% 20.00/3.04 cnf(c1, plain,
% 20.00/3.04 ~neq(sK91,nil),
% 20.00/3.04 inference(start, [], [c0])).
% 20.00/3.04
% 20.00/3.04 cnf(c2, axiom,
% 20.00/3.04 neq(X0,X1) | X0 = X1 | ~ssList(X1) | ~ssList(X0)).
% 20.00/3.04 cnf(a0, assumption,
% 20.00/3.04 sK91 = X0).
% 20.00/3.04 cnf(a1, assumption,
% 20.00/3.04 nil = X1).
% 20.00/3.04 cnf(c3, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.00/3.04 cnf(c4, plain,
% 20.00/3.04 X0 = X1 | ~ssList(X1) | ~ssList(X0),
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.00/3.04
% 20.00/3.04 cnf(c5, axiom,
% 20.00/3.04 sK89 = sK91).
% 20.00/3.04 cnf(a2, assumption,
% 20.00/3.04 sK91 = X0).
% 20.00/3.04 cnf(c6, plain,
% 20.00/3.04 ~ssList(X1) | ~ssList(X0),
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 20.00/3.04 cnf(c7, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 20.00/3.04 cnf(c8, plain,
% 20.00/3.04 sK89 = X1,
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 20.00/3.04
% 20.00/3.04 cnf(c9, axiom,
% 20.00/3.04 ~cyclefreeP(sK89)).
% 20.00/3.04 cnf(a3, assumption,
% 20.00/3.04 sK89 = sK89).
% 20.00/3.04 cnf(c10, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a3])], [c8, c9])).
% 20.00/3.04 cnf(c11, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a3])], [c8, c9])).
% 20.00/3.04 cnf(c12, plain,
% 20.00/3.04 ~cyclefreeP(X1),
% 20.00/3.04 inference(strict_subterm_extension, [assumptions([a3])], [c8, c9])).
% 20.00/3.04
% 20.00/3.04 cnf(c13, axiom,
% 20.00/3.04 cyclefreeP(nil)).
% 20.00/3.04 cnf(a4, assumption,
% 20.00/3.04 X1 = nil).
% 20.00/3.04 cnf(c14, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a4])], [c12, c13])).
% 20.00/3.04 cnf(c15, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a4])], [c12, c13])).
% 20.00/3.04
% 20.00/3.04 cnf(c16, axiom,
% 20.00/3.04 ssList(nil)).
% 20.00/3.04 cnf(a5, assumption,
% 20.00/3.04 X1 = nil).
% 20.00/3.04 cnf(c17, plain,
% 20.00/3.04 ~ssList(X0),
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a5])], [c6, c16])).
% 20.00/3.04 cnf(c18, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a5])], [c6, c16])).
% 20.00/3.04
% 20.00/3.04 cnf(c19, axiom,
% 20.00/3.04 ssList(sK91)).
% 20.00/3.04 cnf(a6, assumption,
% 20.00/3.04 X0 = sK91).
% 20.00/3.04 cnf(c20, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a6])], [c17, c19])).
% 20.00/3.04 cnf(c21, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(strict_predicate_extension, [assumptions([a6])], [c17, c19])).
% 20.00/3.04
% 20.00/3.04 cnf(c22, plain,
% 20.00/3.04 $false,
% 20.00/3.04 inference(constraint_solving, [
% 20.00/3.04 bind(X0, sK91),
% 20.00/3.04 bind(X1, nil)
% 20.00/3.04 ],
% 20.00/3.04 [a0, a1, a2, a3, a4, a5, a6])).
% 20.00/3.04
% 20.00/3.04 % SZS output end IncompleteProof
%------------------------------------------------------------------------------