TSTP Solution File: SYN323-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN323-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n002.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:10 EDT 2023
% Result : Unsatisfiable 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN323-1 : TPTP v8.1.2. Released v1.2.0.
% 0.08/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n002.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:09:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.59 start to proof:theBenchmark
% 0.21/0.63 %-------------------------------------------
% 0.21/0.63 % File :CSE---1.6
% 0.21/0.63 % Problem :theBenchmark
% 0.21/0.63 % Transform :cnf
% 0.21/0.63 % Format :tptp:raw
% 0.21/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.63
% 0.21/0.63 % Result :Theorem 0.000000s
% 0.21/0.63 % Output :CNFRefutation 0.000000s
% 0.21/0.63 %-------------------------------------------
% 0.21/0.64 %--------------------------------------------------------------------------
% 0.21/0.64 % File : SYN323-1 : TPTP v8.1.2. Released v1.2.0.
% 0.21/0.64 % Domain : Syntactic
% 0.21/0.64 % Problem : Church problem 46.4 (2)
% 0.21/0.64 % Version : Especial.
% 0.21/0.64 % English :
% 0.21/0.64
% 0.21/0.64 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 0.21/0.64 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% 0.21/0.64 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% 0.21/0.64 % Source : [Tam94]
% 0.21/0.64 % Names : Ch4N2 [Tam94]
% 0.21/0.64
% 0.21/0.64 % Status : Unsatisfiable
% 0.21/0.64 % Rating : 0.00 v2.0.0
% 0.21/0.64 % Syntax : Number of clauses : 4 ( 0 unt; 1 nHn; 3 RR)
% 0.21/0.64 % Number of literals : 8 ( 0 equ; 4 neg)
% 0.21/0.64 % Maximal clause size : 2 ( 2 avg)
% 0.21/0.64 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.64 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.21/0.64 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% 0.21/0.64 % Number of variables : 4 ( 0 sgn)
% 0.21/0.64 % SPC : CNF_UNS_EPR_NEQ_NHN
% 0.21/0.64
% 0.21/0.64 % Comments : All the problems here can be decided by using a certain
% 0.21/0.64 % completeness-preserving term ordering strategies. See [FL+93].
% 0.21/0.64 % : The conversion from the full 1st order form in [Chu56]
% 0.21/0.64 % to clause form was done by hand by Tanel Tammet.
% 0.21/0.64 %--------------------------------------------------------------------------
% 0.21/0.64 cnf(clause1,negated_conjecture,
% 0.21/0.64 ( f(X,a)
% 0.21/0.64 | g(X,a) ) ).
% 0.21/0.64
% 0.21/0.64 cnf(clause2,negated_conjecture,
% 0.21/0.64 ( ~ f(a,X)
% 0.21/0.64 | g(X,a) ) ).
% 0.21/0.64
% 0.21/0.64 cnf(clause3,negated_conjecture,
% 0.21/0.64 ( f(X,a)
% 0.21/0.64 | ~ g(X,a) ) ).
% 0.21/0.64
% 0.21/0.64 cnf(clause4,negated_conjecture,
% 0.21/0.64 ( ~ f(a,X)
% 0.21/0.64 | ~ g(X,a) ) ).
% 0.21/0.64
% 0.21/0.64 %--------------------------------------------------------------------------
% 0.21/0.64 %-------------------------------------------
% 0.21/0.64 % Proof found
% 0.21/0.64 % SZS status Theorem for theBenchmark
% 0.21/0.64 % SZS output start Proof
% 0.21/0.64 %ClaNum:4(EqnAxiom:0)
% 0.21/0.64 %VarNum:8(SingletonVarNum:4)
% 0.21/0.64 %MaxLitNum:2
% 0.21/0.64 %MaxfuncDepth:0
% 0.21/0.64 %SharedTerms:1
% 0.21/0.64 %goalClause: 1 2 3 4
% 0.21/0.64 [1]P2(x11,a1)+P1(x11,a1)
% 0.21/0.64 [2]~P2(x21,a1)+P1(x21,a1)
% 0.21/0.64 [3]~P1(a1,x31)+P2(x31,a1)
% 0.21/0.64 [4]~P1(a1,x41)+~P2(x41,a1)
% 0.21/0.64 %EqnAxiom
% 0.21/0.64
% 0.21/0.64 %-------------------------------------------
% 0.21/0.64 cnf(5,plain,
% 0.21/0.64 (P2(a1,a1)),
% 0.21/0.64 inference(scs_inference,[],[1,3])).
% 0.21/0.64 cnf(8,plain,
% 0.21/0.64 ($false),
% 0.21/0.64 inference(scs_inference,[],[5,4,2]),
% 0.21/0.64 ['proof']).
% 0.21/0.64 % SZS output end Proof
% 0.21/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------