TSTP Solution File: SYN031-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN031-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 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 : 300s
% DateTime : Fri Sep 1 01:48:39 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 13 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 10 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: $i ).
tff(decl_23,type,
g: ( $i * $i ) > $o ).
tff(decl_24,type,
f: $i > $i ).
cnf(theorem,negated_conjecture,
( ~ g(X1,X2)
| ~ g(X2,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem) ).
cnf(clause1,axiom,
( g(X1,a)
| g(f(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause2,axiom,
( g(X1,a)
| g(X1,f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(c_0_3,negated_conjecture,
( ~ g(X1,X2)
| ~ g(X2,a) ),
theorem ).
cnf(c_0_4,axiom,
( g(X1,a)
| g(f(X1),X1) ),
clause1 ).
cnf(c_0_5,negated_conjecture,
( g(a,a)
| ~ g(X1,f(a)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,axiom,
( g(X1,a)
| g(X1,f(X1)) ),
clause2 ).
cnf(c_0_7,negated_conjecture,
g(a,a),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
~ g(X1,a),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN031-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 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 : 300
% 0.13/0.34 % DateTime : Sat Aug 26 18:40:40 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.004000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.006000 s
%------------------------------------------------------------------------------