TSTP Solution File: CSR113+6 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR113+6 : TPTP v8.1.0. Released v4.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 : n026.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 : Fri Jul 15 20:37:25 EDT 2022
% Result : Theorem 0.37s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR113+6 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n026.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 : Fri Jun 10 19:42:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.37/0.55 % SZS status Theorem
% 0.37/0.55 % SZS output begin IncompleteProof
% 0.37/0.55 cnf(c0, axiom,
% 0.37/0.55 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4)).
% 0.37/0.55 cnf(c1, plain,
% 0.37/0.55 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4),
% 0.37/0.55 inference(start, [], [c0])).
% 0.37/0.55
% 0.37/0.55 cnf(c2, axiom,
% 0.37/0.55 val(c24785,new_york_0)).
% 0.37/0.55 cnf(a0, assumption,
% 0.37/0.55 X0 = c24785).
% 0.37/0.55 cnf(a1, assumption,
% 0.37/0.55 new_york_0 = new_york_0).
% 0.37/0.55 cnf(c3, plain,
% 0.37/0.55 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4),
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.37/0.55 cnf(c4, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.37/0.55
% 0.37/0.55 cnf(c5, axiom,
% 0.37/0.55 sub(c24785,name_1_1)).
% 0.37/0.55 cnf(a2, assumption,
% 0.37/0.55 X0 = c24785).
% 0.37/0.55 cnf(a3, assumption,
% 0.37/0.55 name_1_1 = name_1_1).
% 0.37/0.55 cnf(c6, plain,
% 0.37/0.55 ~scar(X1,X2) | ~flp(X3,X4),
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.37/0.55 cnf(c7, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.37/0.55
% 0.37/0.55 cnf(c8, axiom,
% 0.37/0.55 scar(c24791,c24784)).
% 0.37/0.55 cnf(a4, assumption,
% 0.37/0.55 X1 = c24791).
% 0.37/0.55 cnf(a5, assumption,
% 0.37/0.55 X2 = c24784).
% 0.37/0.55 cnf(c9, plain,
% 0.37/0.55 ~flp(X3,X4),
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.37/0.55 cnf(c10, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.37/0.55
% 0.37/0.55 cnf(c11, axiom,
% 0.37/0.55 flp(c25868,c25819)).
% 0.37/0.55 cnf(a6, assumption,
% 0.37/0.55 X3 = c25868).
% 0.37/0.55 cnf(a7, assumption,
% 0.37/0.55 X4 = c25819).
% 0.37/0.55 cnf(c12, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.37/0.55 cnf(c13, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.37/0.55
% 0.37/0.55 cnf(c14, plain,
% 0.37/0.55 $false,
% 0.37/0.55 inference(constraint_solving, [
% 0.37/0.55 bind(X0, c24785),
% 0.37/0.55 bind(X1, c24791),
% 0.37/0.55 bind(X2, c24784),
% 0.37/0.55 bind(X3, c25868),
% 0.37/0.55 bind(X4, c25819)
% 0.37/0.55 ],
% 0.37/0.55 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.37/0.55
% 0.37/0.55 % SZS output end IncompleteProof
%------------------------------------------------------------------------------