TSTP Solution File: SYN029-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN029-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 : n011.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.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
q: $o ).
tff(decl_23,type,
p: $o ).
tff(decl_24,type,
r: $o ).
cnf(clause2,axiom,
( q
| ~ p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(prove_something,negated_conjecture,
( ~ p
| ~ q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_something) ).
cnf(clause1,axiom,
( q
| p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause3,axiom,
( p
| ~ r
| ~ q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause4,axiom,
r,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(c_0_5,axiom,
( q
| ~ p ),
clause2 ).
cnf(c_0_6,negated_conjecture,
( ~ p
| ~ q ),
prove_something ).
cnf(c_0_7,axiom,
( q
| p ),
clause1 ).
cnf(c_0_8,plain,
~ p,
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
( p
| ~ r
| ~ q ),
clause3 ).
cnf(c_0_10,plain,
q,
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
r,
clause4 ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN029-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.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Sat Aug 26 19:36:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.003000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.005000 s
%------------------------------------------------------------------------------