TSTP Solution File: SYN070-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN070-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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:49:55 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 32 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 77 ( 34 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_f: $i > $o ).
tff(decl_23,type,
f: $i > $i ).
tff(decl_24,type,
big_g: $i > $o ).
tff(decl_25,type,
big_h: ( $i * $i ) > $o ).
tff(decl_26,type,
a: $i ).
tff(decl_27,type,
big_j: ( $i * $i ) > $o ).
tff(decl_28,type,
b: $i ).
cnf(clause_6,axiom,
( big_g(X1)
| big_g(X2)
| big_j(a,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,axiom,
( big_f(f(X1))
| big_g(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_8,negated_conjecture,
big_f(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_9,negated_conjecture,
~ big_g(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_4,axiom,
( big_g(X1)
| big_f(a)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_7,axiom,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_2,axiom,
( big_h(f(X1),X1)
| big_g(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_9,axiom,
( big_g(X1)
| big_g(X2)
| big_j(a,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
clause_6 ).
cnf(c_0_10,axiom,
( big_f(f(X1))
| big_g(X1)
| ~ big_f(X1) ),
clause_1 ).
cnf(c_0_11,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(f(X1)) ),
clause_3 ).
cnf(c_0_12,plain,
( big_j(a,f(X1))
| big_g(X1)
| big_g(X2)
| ~ big_f(X2)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
big_f(b),
clause_8 ).
cnf(c_0_14,negated_conjecture,
~ big_g(b),
clause_9 ).
cnf(c_0_15,axiom,
( big_g(X1)
| big_f(a)
| ~ big_f(X1) ),
clause_4 ).
cnf(c_0_16,axiom,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
clause_7 ).
cnf(c_0_17,negated_conjecture,
( big_j(a,f(X1))
| big_g(X1)
| ~ big_f(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
big_f(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( big_g(X1)
| ~ big_h(f(X1),a)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_10]) ).
cnf(c_0_20,axiom,
( big_h(f(X1),X1)
| big_g(X1)
| ~ big_f(X1) ),
clause_2 ).
cnf(c_0_21,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(a) ),
clause_5 ).
cnf(c_0_22,negated_conjecture,
big_g(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]) ).
cnf(c_0_23,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN070-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n001.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 17:58:01 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.59 % Total time : 0.004000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------