TSTP Solution File: LCL013-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL013-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 %s %d
% Computer : n008.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:39 EDT 2023
% Result : Unsatisfiable 120.60s 122.06s
% Output : CNFRefutation 120.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n008.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 : Fri Aug 25 02:03:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 120.53/122.04 %-------------------------------------------
% 120.53/122.04 % File :CSE---1.6
% 120.53/122.04 % Problem :theBenchmark
% 120.53/122.04 % Transform :cnf
% 120.53/122.04 % Format :tptp:raw
% 120.53/122.04 % Command :java -jar mcs_scs.jar %d %s
% 120.53/122.04
% 120.53/122.04 % Result :Theorem 120.000000s
% 120.53/122.04 % Output :CNFRefutation 120.000000s
% 120.53/122.04 %-------------------------------------------
% 120.60/122.06 %--------------------------------------------------------------------------
% 120.60/122.06 % File : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% 120.60/122.06 % Domain : Logic Calculi (Equivalential)
% 120.60/122.06 % Problem : UM depends on XGF
% 120.60/122.06 % Version : [McC92] axioms.
% 120.60/122.06 % English : Show that the single Meredith axiom UM can be derived from
% 120.60/122.06 % the single Meredith axiom XGF.
% 120.60/122.06
% 120.60/122.06 % Refs : [MW92] McCune & Wos (1992), Experiments in Automated Deductio
% 120.60/122.06 % : [McC92] McCune (1992), Email to G. Sutcliffe
% 120.60/122.06 % : [Wos95] Wos (1995), Searching for Circles of Pure Proofs
% 120.60/122.06 % Source : [McC92]
% 120.60/122.06 % Names : EC-76 [MW92]
% 120.60/122.06
% 120.60/122.06 % Status : Unsatisfiable
% 120.60/122.06 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.1.0, 0.00 v2.0.0
% 120.60/122.06 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% 120.60/122.06 % Number of literals : 5 ( 0 equ; 3 neg)
% 120.60/122.06 % Maximal clause size : 3 ( 1 avg)
% 120.60/122.06 % Maximal term depth : 5 ( 2 avg)
% 120.60/122.06 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 120.60/122.06 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% 120.60/122.06 % Number of variables : 5 ( 0 sgn)
% 120.60/122.06 % SPC : CNF_UNS_RFO_NEQ_HRN
% 120.60/122.06
% 120.60/122.06 % Comments :
% 120.60/122.06 %--------------------------------------------------------------------------
% 120.60/122.06 cnf(condensed_detachment,axiom,
% 120.60/122.06 ( ~ is_a_theorem(equivalent(X,Y))
% 120.60/122.06 | ~ is_a_theorem(X)
% 120.60/122.06 | is_a_theorem(Y) ) ).
% 120.60/122.06
% 120.60/122.06 %----Axiom by Meredith
% 120.60/122.06 cnf(xgf,axiom,
% 120.60/122.06 is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(X,Z)),equivalent(Z,Y)))) ).
% 120.60/122.06
% 120.60/122.06 %----Axiom by Meredith
% 120.60/122.06 cnf(prove_um,negated_conjecture,
% 120.60/122.06 ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))) ).
% 120.60/122.06
% 120.60/122.06 %--------------------------------------------------------------------------
% 120.60/122.06 %-------------------------------------------
% 120.60/122.06 % Proof found
% 120.60/122.06 % SZS status Theorem for theBenchmark
% 120.60/122.06 % SZS output start Proof
% 120.62/122.08 %ClaNum:3(EqnAxiom:0)
% 120.62/122.08 %VarNum:10(SingletonVarNum:5)
% 120.62/122.08 %MaxLitNum:3
% 120.62/122.08 %MaxfuncDepth:3
% 120.62/122.08 %SharedTerms:9
% 120.62/122.08 %goalClause: 2
% 120.62/122.08 %singleGoalClaCount:1
% 120.62/122.08 [2]~P1(f1(f1(f1(a2,a3),a4),f1(a3,f1(a4,a2))))
% 120.62/122.08 [1]P1(f1(x11,f1(f1(x12,f1(x11,x13)),f1(x13,x12))))
% 120.62/122.08 [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31))
% 120.62/122.08 %EqnAxiom
% 120.62/122.08
% 120.62/122.08 %-------------------------------------------
% 120.62/122.10 cnf(4,plain,
% 120.62/122.10 (P1(f1(f1(x41,f1(x42,x43)),f1(x43,x41)))+~P1(x42)),
% 120.62/122.10 inference(scs_inference,[],[1,3])).
% 120.62/122.10 cnf(6,plain,
% 120.62/122.10 (~P1(f1(f1(a3,f1(a4,a2)),f1(f1(x61,f1(f1(x62,f1(x61,x63)),f1(x63,x62))),f1(f1(a2,a3),a4))))),
% 120.62/122.10 inference(scs_inference,[],[1,2,4,3])).
% 120.62/122.10 cnf(7,plain,
% 120.62/122.10 ($false),
% 120.62/122.10 inference(scs_inference,[],[6,1]),
% 120.62/122.10 ['proof']).
% 120.62/122.10 % SZS output end Proof
% 120.62/122.10 % Total time :120.000000s
%------------------------------------------------------------------------------