TSTP Solution File: COL055-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL055-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 : n028.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:22:18 EDT 2023
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 9 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 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 : 5 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: $i ).
tff(decl_23,type,
b: $i ).
tff(decl_24,type,
response: ( $i * $i ) > $i ).
cnf(prove_happiness,negated_conjecture,
( response(a,X1) != X2
| response(a,X2) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_happiness) ).
cnf(fond_bird_exists,hypothesis,
response(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fond_bird_exists) ).
cnf(c_0_2,negated_conjecture,
( response(a,X1) != X2
| response(a,X2) != X1 ),
prove_happiness ).
cnf(c_0_3,negated_conjecture,
response(a,response(a,X1)) != X1,
inference(er,[status(thm)],[c_0_2]) ).
cnf(c_0_4,hypothesis,
response(a,b) = b,
fond_bird_exists ).
cnf(c_0_5,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL055-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n028.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 04:24:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.57 % Version : CSE_E---1.5
% 0.20/0.57 % Problem : theBenchmark.p
% 0.20/0.57 % Proof found
% 0.20/0.57 % SZS status Theorem for theBenchmark.p
% 0.20/0.57 % SZS output start Proof
% See solution above
% 0.20/0.57 % Total time : 0.002000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.005000 s
%------------------------------------------------------------------------------