TSTP Solution File: LCL853-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL853-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n023.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 : 600s
% DateTime : Sun Jul 17 10:26:00 EDT 2022
% Result : Unsatisfiable 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL853-1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n023.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 : 600
% 0.14/0.34 % DateTime : Mon Jul 4 07:26:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Number of axioms: 47 Number of unprocessed: 47
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 47 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 19 unit axioms.
% 0.20/0.37 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.20/0.37 # Found closed tableau while making start rule
% 0.20/0.37 # There were 0 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 0 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 0 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_92, plain, (class_Orderings_Opreorder(tc_nat))).
% 0.20/0.37 cnf(i_0_93, plain, (class_Orderings_Olinorder(tc_nat))).
% 0.20/0.37 cnf(i_0_94, plain, (class_Orderings_Oorder(tc_nat))).
% 0.20/0.37 cnf(i_0_86, plain, (c_InductTermi_OIT(v_s____))).
% 0.20/0.37 cnf(i_0_89, plain, (c_InductTermi_OIT(v_ta____))).
% 0.20/0.37 cnf(i_0_91, negated_conjecture, (~c_InductTermi_OIT(v_s____))).
% 0.20/0.37 cnf(i_0_88, plain, (c_InductTermi_OIT(c_Lambda_OdB_OVar(X1)))).
% 0.20/0.37 cnf(i_0_85, plain, (c_Lambda_OdB_OVar(X2)!=c_Lambda_OdB_OAbs(X1))).
% 0.20/0.37 cnf(i_0_81, plain, (c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OAbs(X2))).
% 0.20/0.37 cnf(i_0_82, plain, (X1=X2|c_Lambda_OdB_OAbs(X1)!=c_Lambda_OdB_OAbs(X2))).
% 0.20/0.37 cnf(i_0_84, plain, (X1=X2|c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OVar(X2))).
% 0.20/0.37 cnf(i_0_90, plain, (c_InductTermi_OIT(c_Lambda_OdB_OAbs(X1))|~c_InductTermi_OIT(X1))).
% 0.20/0.37 cnf(i_0_54, plain, (c_Lambda_OdB_OAbs(X1)!=c_Lambda_OdB_OApp(X2,X3))).
% 0.20/0.37 cnf(i_0_71, plain, (c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OApp(X2,X3))).
% 0.20/0.37 cnf(i_0_53, plain, (c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OAbs(X3))).
% 0.20/0.37 cnf(i_0_78, plain, (c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OVar(X3))).
% 0.20/0.37 cnf(i_0_87, plain, (c_InductTermi_OIT(c_Lambda_Olift(X1,X2))|~c_InductTermi_OIT(X1))).
% 0.20/0.37 cnf(i_0_58, plain, (X2=X4|c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OApp(X3,X4))).
% 0.20/0.37 cnf(i_0_57, plain, (X1=X3|c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OApp(X3,X4))).
% 0.20/0.37 cnf(i_0_79, plain, (c_InductTermi_OIT(c_Lambda_OdB_OApp(X1,c_Lambda_OdB_OVar(X2)))|~c_InductTermi_OIT(X1))).
% 0.20/0.37 cnf(i_0_55, plain, (c_Lambda_Osubst(c_Lambda_OdB_OVar(X1),X2,X1)=X2)).
% 0.20/0.37 cnf(i_0_77, plain, (c_Lambda_Osubst(c_Lambda_Olift(X1,X2),X3,X2)=X1)).
% 0.20/0.37 cnf(i_0_69, plain, (~c_HOL_Oord__class_Oless(X1,X1,tc_nat))).
% 0.20/0.37 cnf(i_0_70, plain, (~c_HOL_Oord__class_Oless(X1,X1,tc_nat))).
% 0.20/0.37 cnf(i_0_66, plain, (~class_Orderings_Opreorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))).
% 0.20/0.37 cnf(i_0_67, plain, (~class_Orderings_Olinorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))).
% 0.20/0.37 cnf(i_0_68, plain, (~class_Orderings_Oorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))).
% 0.20/0.37 cnf(i_0_72, plain, (c_Lambda_OdB_OApp(c_Lambda_Olift(X1,X3),c_Lambda_Olift(X2,X3))=c_Lambda_Olift(c_Lambda_OdB_OApp(X1,X2),X3))).
% 0.20/0.37 cnf(i_0_80, plain, (c_Lambda_Olift(c_Lambda_OdB_OVar(X1),X2)=c_Lambda_OdB_OVar(X1)|~c_HOL_Oord__class_Oless(X1,X2,tc_nat))).
% 0.20/0.37 cnf(i_0_62, plain, (X1=X2|c_HOL_Oord__class_Oless(X2,X1,tc_nat)|c_HOL_Oord__class_Oless(X1,X2,tc_nat))).
% 0.20/0.37 cnf(i_0_63, plain, (X1=X2|c_HOL_Oord__class_Oless(X2,X1,tc_nat)|c_HOL_Oord__class_Oless(X1,X2,tc_nat))).
% 0.20/0.37 cnf(i_0_76, plain, (c_Lambda_Osubst(c_Lambda_OdB_OVar(X1),X2,X1)=X2|c_HOL_Oord__class_Oless(X1,X1,tc_nat))).
% 0.20/0.37 cnf(i_0_59, plain, (X2=X3|c_HOL_Oord__class_Oless(X3,X2,X1)|c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Olinorder(X1))).
% 0.20/0.37 cnf(i_0_60, plain, (X2=X3|c_HOL_Oord__class_Oless(X3,X2,X1)|c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Olinorder(X1))).
% 0.20/0.37 cnf(i_0_61, plain, (X2=X3|c_HOL_Oord__class_Oless(X3,X2,X1)|c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Olinorder(X1))).
% 0.20/0.37 cnf(i_0_64, plain, (X2=X3|c_HOL_Oord__class_Oless(X3,X2,X1)|c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Olinorder(X1))).
% 0.20/0.37 cnf(i_0_65, plain, (X2=X3|c_HOL_Oord__class_Oless(X3,X2,X1)|c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.20/0.37 cnf(i_0_73, plain, (X1=X3|c_Lambda_Osubst(c_Lambda_OdB_OVar(X1),X2,X3)=c_Lambda_OdB_OVar(X1)|c_HOL_Oord__class_Oless(X3,X1,tc_nat))).
% 0.20/0.37 cnf(i_0_83, plain, (c_InductTermi_OIT(c_Lambda_Osubst(X1,c_Lambda_OdB_OVar(X2),X3))|~c_InductTermi_OIT(X1))).
% 0.20/0.37 cnf(i_0_56, plain, (c_Lambda_Osubst(c_Lambda_OdB_OVar(X1),X2,X3)=c_Lambda_OdB_OVar(X1)|~c_HOL_Oord__class_Oless(X1,X3,tc_nat))).
% 0.20/0.37 cnf(i_0_48, plain, (~class_Orderings_Opreorder(X1)|~c_HOL_Oord__class_Oless(X3,X2,X1)|~c_HOL_Oord__class_Oless(X2,X3,X1))).
% 0.20/0.37 cnf(i_0_49, plain, (~class_Orderings_Opreorder(X1)|~c_HOL_Oord__class_Oless(X3,X2,X1)|~c_HOL_Oord__class_Oless(X2,X3,X1))).
% 0.20/0.37 cnf(i_0_50, plain, (~class_Orderings_Olinorder(X1)|~c_HOL_Oord__class_Oless(X3,X2,X1)|~c_HOL_Oord__class_Oless(X2,X3,X1))).
% 0.20/0.37 cnf(i_0_51, plain, (~class_Orderings_Oorder(X1)|~c_HOL_Oord__class_Oless(X3,X2,X1)|~c_HOL_Oord__class_Oless(X2,X3,X1))).
% 0.20/0.37 cnf(i_0_74, plain, (c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Opreorder(X1)|~c_HOL_Oord__class_Oless(X4,X3,X1)|~c_HOL_Oord__class_Oless(X2,X4,X1))).
% 0.20/0.37 cnf(i_0_75, plain, (c_HOL_Oord__class_Oless(X2,X3,X1)|~class_Orderings_Oorder(X1)|~c_HOL_Oord__class_Oless(X4,X3,X1)|~c_HOL_Oord__class_Oless(X2,X4,X1))).
% 0.20/0.37 cnf(i_0_52, plain, (c_Lambda_OdB_OApp(c_Lambda_Osubst(X1,X3,X4),c_Lambda_Osubst(X2,X3,X4))=c_Lambda_Osubst(c_Lambda_OdB_OApp(X1,X2),X3,X4))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 2 steps
% 0.20/0.37 cnf(i_0_91, negated_conjecture, (~c_InductTermi_OIT(v_s____)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_95, plain, (~c_InductTermi_OIT(v_s____)), inference(closure_rule, [i_0_86])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # NOT attempting initial tableau saturation
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 28 extension rule candidate clauses
% 0.20/0.37 # 19 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Proof search is over...
% 0.20/0.37 # Freeing feature tree
%------------------------------------------------------------------------------