TSTP Solution File: SYN349-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN349-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : Fri Sep 1 01:51:19 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 29 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
g: ( $i * $i ) > $i ).
tff(decl_23,type,
f: ( $i * $i ) > $o ).
tff(decl_24,type,
w: $i > $i ).
cnf(clause3,negated_conjecture,
( f(g(X1,X2),X2)
| f(g(X1,X2),w(X1))
| ~ f(X1,g(X1,X2))
| ~ f(X2,g(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause2,negated_conjecture,
( f(w(X1),g(X1,X2))
| ~ f(X1,g(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause10,negated_conjecture,
( ~ f(X1,g(X1,X2))
| ~ f(g(X1,X2),X2)
| ~ f(X2,g(X1,X2))
| ~ f(g(X1,X2),w(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause1,negated_conjecture,
( f(X1,g(X1,X2))
| ~ f(w(X1),g(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause5,negated_conjecture,
( f(X1,g(X1,X2))
| f(g(X1,X2),X2)
| f(X2,g(X1,X2))
| f(g(X1,X2),w(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause8,negated_conjecture,
( f(X1,g(X1,X2))
| f(X2,g(X1,X2))
| ~ f(g(X1,X2),X2)
| ~ f(g(X1,X2),w(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(c_0_6,negated_conjecture,
( f(g(X1,X2),X2)
| f(g(X1,X2),w(X1))
| ~ f(X1,g(X1,X2))
| ~ f(X2,g(X1,X2)) ),
clause3 ).
cnf(c_0_7,negated_conjecture,
( f(w(X1),g(X1,X2))
| ~ f(X1,g(X1,X2)) ),
clause2 ).
cnf(c_0_8,negated_conjecture,
( ~ f(X1,g(X1,X2))
| ~ f(g(X1,X2),X2)
| ~ f(X2,g(X1,X2))
| ~ f(g(X1,X2),w(X1)) ),
clause10 ).
cnf(c_0_9,negated_conjecture,
( f(g(X1,w(X1)),w(X1))
| ~ f(X1,g(X1,w(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( f(X1,g(X1,X2))
| ~ f(w(X1),g(X1,X2)) ),
clause1 ).
cnf(c_0_11,negated_conjecture,
( ~ f(w(X1),g(X1,w(X1)))
| ~ f(g(X1,w(X1)),w(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ f(w(X1),g(X1,w(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( f(X1,g(X1,X2))
| f(g(X1,X2),X2)
| f(X2,g(X1,X2))
| f(g(X1,X2),w(X1)) ),
clause5 ).
cnf(c_0_14,negated_conjecture,
~ f(X1,g(X1,w(X1))),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( f(X1,g(X1,X2))
| f(X2,g(X1,X2))
| ~ f(g(X1,X2),X2)
| ~ f(g(X1,X2),w(X1)) ),
clause8 ).
cnf(c_0_16,negated_conjecture,
f(g(X1,w(X1)),w(X1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_13]),c_0_12]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]),c_0_12]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN349-1 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 17:31:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.005000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------