TSTP Solution File: BOO075-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO075-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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 : 300s
% DateTime : Wed Aug 30 18:06:05 EDT 2023
% Result : Unsatisfiable 0.56s 0.67s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 31 unt; 3 typ; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 8 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nand: ( $i * $i ) > $i ).
tff(decl_23,type,
a: $i ).
tff(decl_24,type,
b: $i ).
cnf(sh_1,axiom,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,X1))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sh_1) ).
cnf(prove_meredith_2_basis_1,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_meredith_2_basis_1) ).
cnf(c_0_2,axiom,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,X1))) = X2,
sh_1 ).
cnf(c_0_3,plain,
nand(nand(nand(X1,nand(X2,X3)),nand(nand(X4,nand(X1,nand(X2,X3))),nand(X1,nand(X2,X3)))),nand(X4,X1)) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
nand(nand(nand(X1,X2),nand(nand(X3,nand(X1,X2)),nand(X1,X2))),nand(X3,X1)) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,nand(nand(X1,X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
nand(nand(X1,nand(nand(nand(X2,nand(nand(X2,X2),X2)),X1),X1)),X2) = nand(X2,nand(nand(X2,X2),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(nand(X2,X2),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
nand(X1,nand(nand(X1,X1),X1)) = nand(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
cnf(c_0_9,plain,
nand(nand(X1,X1),nand(X1,nand(X2,X1))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_8]) ).
cnf(c_0_10,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,X2)) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
nand(nand(X1,X1),nand(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_8]),c_0_8]) ).
cnf(c_0_12,plain,
nand(nand(nand(X1,nand(X2,X1)),nand(X1,nand(X1,nand(X2,X1)))),nand(nand(X1,X1),X1)) = nand(X1,X1),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_13,plain,
nand(nand(nand(X1,nand(X2,X1)),nand(X1,nand(X1,nand(X2,X1)))),X1) = nand(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_14,plain,
nand(nand(X1,nand(X2,X1)),nand(X1,nand(X1,nand(X2,X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_13]),c_0_8]),c_0_11]) ).
cnf(c_0_15,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X1,nand(X3,X1)))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_16,plain,
nand(nand(nand(X1,nand(X2,X1)),nand(X1,nand(X2,X1))),X1) = nand(X1,nand(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_14]),c_0_8]) ).
cnf(c_0_17,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X1,nand(X1,nand(X3,X1))))) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
nand(X1,nand(nand(X1,nand(X2,X1)),X1)) = nand(X1,nand(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_19,plain,
nand(nand(X1,nand(nand(nand(X1,nand(X2,X1)),X1),X1)),X1) = nand(X1,nand(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,plain,
nand(X1,nand(nand(nand(X1,nand(X2,X1)),X1),X1)) = nand(X1,nand(X1,nand(X2,X1))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
nand(nand(X1,nand(X1,nand(X2,X1))),X1) = nand(X1,nand(X2,X1)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
nand(X1,nand(nand(X2,nand(nand(X1,X2),X2)),nand(X3,nand(X1,X1)))) = nand(X2,nand(nand(X1,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_10]),c_0_9]) ).
cnf(c_0_23,plain,
nand(X1,nand(X1,nand(X1,nand(X2,X1)))) = nand(X1,nand(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_18]) ).
cnf(c_0_24,plain,
nand(X1,nand(nand(X2,nand(nand(X1,X2),X2)),X1)) = nand(X2,nand(nand(X1,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_10]),c_0_9]) ).
cnf(c_0_25,plain,
nand(X1,nand(nand(X1,nand(X2,X1)),nand(X3,nand(X1,X1)))) = nand(X1,nand(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14]),c_0_21]),c_0_14]),c_0_21]) ).
cnf(c_0_26,plain,
nand(nand(X1,X1),nand(X2,nand(nand(X1,X2),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_24]),c_0_8]) ).
cnf(c_0_27,plain,
nand(X1,nand(nand(X2,X1),X1)) = nand(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_2]) ).
cnf(c_0_28,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
prove_meredith_2_basis_1 ).
cnf(c_0_29,plain,
nand(nand(X1,X1),nand(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : BOO075-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun Aug 27 08:19:39 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.56/0.67 % Version : CSE_E---1.5
% 0.56/0.67 % Problem : theBenchmark.p
% 0.56/0.67 % Proof found
% 0.56/0.67 % SZS status Theorem for theBenchmark.p
% 0.56/0.67 % SZS output start Proof
% See solution above
% 0.56/0.68 % Total time : 0.070000 s
% 0.56/0.68 % SZS output end Proof
% 0.56/0.68 % Total time : 0.073000 s
%------------------------------------------------------------------------------