TSTP Solution File: LAT394-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT394-1 : TPTP v8.1.2. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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 : Thu Aug 31 06:02:29 EDT 2023
% Result : Unsatisfiable 0.21s 0.67s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 32 unt; 6 typ; 0 def)
% Number of atoms : 32 ( 31 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 : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 20 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: ( $i * $i ) > $i ).
tff(decl_23,type,
or: ( $i * $i ) > $i ).
tff(decl_24,type,
and: ( $i * $i ) > $i ).
tff(decl_25,type,
neg: $i > $i ).
tff(decl_26,type,
x0: $i ).
tff(decl_27,type,
x1: $i ).
cnf(sos,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_2,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
sos ).
cnf(c_0_3,plain,
f(X1,f(f(X1,X2),f(f(f(X1,X2),f(f(f(X3,X1),f(X3,X1)),f(X3,X1))),X4))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
f(f(X1,X2),f(f(f(X1,X2),f(X2,X3)),X2)) = f(f(X1,X2),f(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
f(f(f(f(X1,X2),f(X2,X3)),X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
f(f(X1,X1),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
f(f(X1,X2),f(X1,f(f(X1,f(f(X1,X1),X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
f(X1,f(f(X1,X2),f(X1,X2))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
f(f(X1,X2),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
f(X1,f(f(X1,X1),X2)) = f(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
f(f(X1,X1),f(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_13,plain,
f(f(X1,X2),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_14,plain,
f(f(f(X1,X2),f(X1,X2)),X1) = f(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,plain,
f(f(X1,X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,plain,
f(f(X1,X2),f(X2,f(f(X1,X1),X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_17,plain,
f(f(X1,X1),f(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
f(X1,f(f(X1,X2),f(X1,f(X1,X1)))) = f(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_9]) ).
cnf(c_0_19,plain,
f(X1,f(X2,f(X1,X1))) = f(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
f(f(X1,X2),f(X1,f(f(X3,X3),X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_18]),c_0_19]),c_0_15]) ).
cnf(c_0_21,plain,
f(X1,f(f(X2,X1),f(X2,X1))) = f(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_10]),c_0_10]) ).
cnf(c_0_22,plain,
f(X1,X1) = f(X1,f(f(X2,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
f(X1,f(f(X2,X1),f(X1,f(X1,X1)))) = f(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]) ).
cnf(c_0_24,plain,
f(f(f(X1,X1),X1),X2) = f(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6]) ).
cnf(c_0_25,plain,
f(f(X1,X1),X1) = f(X1,f(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_8]) ).
cnf(c_0_26,plain,
f(f(X1,f(X2,X2)),X2) = f(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_27,plain,
f(f(X1,f(X2,f(X2,X2))),f(X3,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_25]) ).
cnf(c_0_28,plain,
f(f(X1,X2),f(X2,f(X3,f(X3,X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
goals ).
cnf(c_0_30,plain,
f(X1,f(X1,X1)) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT394-1 : TPTP v8.1.2. Released v5.4.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 24 04:26:54 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.67 % Version : CSE_E---1.5
% 0.21/0.67 % Problem : theBenchmark.p
% 0.21/0.67 % Proof found
% 0.21/0.67 % SZS status Theorem for theBenchmark.p
% 0.21/0.67 % SZS output start Proof
% See solution above
% 0.21/0.67 % Total time : 0.090000 s
% 0.21/0.67 % SZS output end Proof
% 0.21/0.67 % Total time : 0.091000 s
%------------------------------------------------------------------------------