TSTP Solution File: SYN381+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 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:45:31 EDT 2023
% Result : Theorem 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 19:43:38 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % File :CSE---1.6
% 0.20/0.62 % Problem :theBenchmark
% 0.20/0.62 % Transform :cnf
% 0.20/0.62 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.000000s
% 0.20/0.62 % Output :CNFRefutation 0.000000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 % File : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.62 % Domain : Syntactic
% 0.20/0.62 % Problem : Peter Andrews Problem X2133
% 0.20/0.63 % Version : Especial.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [And86] Andrews (1986), An Introduction to Mathematical Logic
% 0.20/0.63 % : [And94] Andrews (1994), Email to G. Sutcliffe
% 0.20/0.63 % Source : [And94]
% 0.20/0.63 % Names : X2133 [And86]
% 0.20/0.63
% 0.20/0.63 % Status : Theorem
% 0.20/0.63 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.22 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.20/0.63 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.20/0.63 % Number of atoms : 7 ( 0 equ)
% 0.20/0.63 % Maximal formula atoms : 7 ( 7 avg)
% 0.20/0.63 % Number of connectives : 6 ( 0 ~; 1 |; 2 &)
% 0.20/0.63 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.63 % Maximal formula depth : 8 ( 8 avg)
% 0.20/0.63 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.63 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty)
% 0.20/0.63 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.63 % Number of variables : 7 ( 5 !; 2 ?)
% 0.20/0.63 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.63
% 0.20/0.63 % Comments :
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 fof(x2133,conjecture,
% 0.20/0.63 ( ( ! [X] :
% 0.20/0.63 ( ? [Y] : big_q(X,Y)
% 0.20/0.63 => big_p(X) )
% 0.20/0.63 & ! [V] :
% 0.20/0.63 ? [U] : big_q(U,V)
% 0.20/0.63 & ! [W,Z] :
% 0.20/0.63 ( big_q(W,Z)
% 0.20/0.63 => ( big_q(Z,W)
% 0.20/0.63 | big_q(Z,Z) ) ) )
% 0.20/0.63 => ! [Z] : big_p(Z) ) ).
% 0.20/0.63
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:4(EqnAxiom:0)
% 0.20/0.63 %VarNum:11(SingletonVarNum:5)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:1
% 0.20/0.63 %SharedTerms:2
% 0.20/0.63 %goalClause: 1 2 3 4
% 0.20/0.63 %singleGoalClaCount:2
% 0.20/0.63 [2]~P2(a2)
% 0.20/0.63 [1]P1(f1(x11),x11)
% 0.20/0.63 [3]P2(x31)+~P1(x31,x32)
% 0.20/0.63 [4]~P1(x42,x41)+P1(x41,x41)+P1(x41,x42)
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 cnf(5,plain,
% 0.20/0.63 (~P1(a2,x51)),
% 0.20/0.63 inference(scs_inference,[],[2,3])).
% 0.20/0.63 cnf(6,plain,
% 0.20/0.63 (P1(a2,a2)),
% 0.20/0.63 inference(scs_inference,[],[1,2,3,4])).
% 0.20/0.63 cnf(9,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[5,6]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------