TSTP Solution File: LCL035-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL035-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 %s %d
% Computer : n005.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 : Thu Aug 31 06:47:44 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 16:56:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.54 start to proof:theBenchmark
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 % File :CSE---1.6
% 0.19/0.59 % Problem :theBenchmark
% 0.19/0.59 % Transform :cnf
% 0.19/0.59 % Format :tptp:raw
% 0.19/0.59 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.59
% 0.19/0.59 % Result :Theorem 0.000000s
% 0.19/0.59 % Output :CNFRefutation 0.000000s
% 0.19/0.59 %-------------------------------------------
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 % File : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.19/0.60 % Domain : Logic Calculi (Implication/Falsehood 2 valued sentential)
% 0.19/0.60 % Problem : C0-4 depends on the Merideth axiom
% 0.19/0.60 % Version : [McC92] axioms.
% 0.19/0.60 % English : Axiomatisations for the Implication/Falsehood 2 valued
% 0.19/0.60 % sentential calculus are {C0-1,C0-2,C0-3,C0-4}
% 0.19/0.60 % by Tarski-Bernays, {C0-2,C0-5,C0-6} by Church, and the single
% 0.19/0.60 % Meredith axioms. Show that C0-4 can be derived from the
% 0.19/0.60 % single Meredith axiom.
% 0.19/0.60
% 0.19/0.60 % Refs : [Mer53] Meredith (1953), Single Axioms for the Systems (C,N),
% 0.19/0.60 % : [MW92] McCune & Wos (1992), Experiments in Automated Deductio
% 0.19/0.60 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 0.19/0.60 % Source : [McC92]
% 0.19/0.60 % Names : C0-47 [MW92]
% 0.19/0.60
% 0.19/0.60 % Status : Unsatisfiable
% 0.19/0.60 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.1.0, 0.00 v2.0.0
% 0.19/0.60 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% 0.19/0.60 % Number of literals : 5 ( 0 equ; 3 neg)
% 0.19/0.60 % Maximal clause size : 3 ( 1 avg)
% 0.19/0.60 % Maximal term depth : 6 ( 2 avg)
% 0.19/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 0.19/0.60 % Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% 0.19/0.60 % Number of variables : 7 ( 2 sgn)
% 0.19/0.60 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.60
% 0.19/0.60 % Comments :
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 cnf(condensed_detachment,axiom,
% 0.19/0.60 ( ~ is_a_theorem(implies(X,Y))
% 0.19/0.60 | ~ is_a_theorem(X)
% 0.19/0.60 | is_a_theorem(Y) ) ).
% 0.19/0.60
% 0.19/0.60 cnf(c0_CAMerideth,axiom,
% 0.19/0.60 is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))) ).
% 0.19/0.60
% 0.19/0.60 cnf(prove_c0_4,negated_conjecture,
% 0.19/0.60 ~ is_a_theorem(implies(falsehood,a)) ).
% 0.19/0.60
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark
% 0.19/0.60 % SZS output start Proof
% 0.19/0.60 %ClaNum:3(EqnAxiom:0)
% 0.19/0.60 %VarNum:13(SingletonVarNum:7)
% 0.19/0.60 %MaxLitNum:3
% 0.19/0.60 %MaxfuncDepth:3
% 0.19/0.60 %SharedTerms:4
% 0.19/0.60 %goalClause: 2
% 0.19/0.60 %singleGoalClaCount:1
% 0.19/0.60 [2]~P1(f1(a2,a3))
% 0.19/0.60 [1]P1(f1(f1(f1(f1(f1(x11,x12),f1(x13,a2)),x14),x15),f1(f1(x15,x11),f1(x13,x11))))
% 0.19/0.60 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31))
% 0.19/0.60 %EqnAxiom
% 0.19/0.60
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 cnf(5,plain,
% 0.19/0.60 (P1(f1(f1(x51,x52),f1(x53,x52)))+~P1(f1(f1(f1(f1(x52,x54),f1(x53,a2)),x55),x51))),
% 0.19/0.60 inference(scs_inference,[],[1,3])).
% 0.19/0.60 cnf(6,plain,
% 0.19/0.60 (P1(f1(f1(f1(f1(x61,x62),f1(x63,x62)),f1(x62,x64)),f1(x65,f1(x62,x64))))),
% 0.19/0.60 inference(scs_inference,[],[1,5])).
% 0.19/0.60 cnf(9,plain,
% 0.19/0.60 (~P1(f1(f1(f1(f1(f1(x91,x92),f1(x93,x92)),f1(x92,x94)),f1(x95,f1(x92,x94))),f1(a2,a3)))),
% 0.19/0.60 inference(scs_inference,[],[6,2,3])).
% 0.19/0.60 cnf(11,plain,
% 0.19/0.60 (P1(f1(f1(f1(x111,f1(a2,x112)),x113),f1(x114,x113)))),
% 0.19/0.60 inference(scs_inference,[],[6,1,3])).
% 0.19/0.60 cnf(17,plain,
% 0.19/0.60 (~P1(f1(f1(x171,f1(a2,x172)),f1(a2,a3)))),
% 0.19/0.60 inference(scs_inference,[],[9,11,3])).
% 0.19/0.60 cnf(20,plain,
% 0.19/0.60 (~P1(f1(f1(f1(f1(x201,f1(a2,x202)),x203),f1(x204,x203)),f1(f1(x205,f1(a2,x206)),f1(a2,a3))))),
% 0.19/0.60 inference(scs_inference,[],[11,17,3])).
% 0.19/0.60 cnf(26,plain,
% 0.19/0.60 ($false),
% 0.19/0.60 inference(scs_inference,[],[11,20,6,3]),
% 0.19/0.60 ['proof']).
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time :0.000000s
%------------------------------------------------------------------------------