%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL853-1 : TPTP v9.3.1. 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 : n007.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:02:09 PM UTC 2026 % Result : Unsatisfiable 0.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL853-1 : TPTP v9.3.1. Released v4.1.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.07/0.35 % Computer : n007.cluster.edu % 0.07/0.35 % Model : x86_64 x86_64 % 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.35 % Memory : 8046.5625MB % 0.07/0.35 % OS : Linux 6.8.0-71-generic % 0.07/0.35 % CPULimit : 300 % 0.07/0.35 % WCLimit : 300 % 0.07/0.35 % DateTime : Sat Sep 5 00:34:39 UTC 2026 % 0.07/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.38 # % 0.12/0.38 # Number of axioms: 47 Number of unprocessed: 47 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 47 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 1 conjectures. % 0.12/0.38 # There are 1 start rule candidates: % 0.12/0.38 # Found 19 unit axioms. % 0.12/0.38 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.12/0.38 # Found closed tableau while making start rule % 0.12/0.38 # There were 0 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_92, plain, (class_Orderings_Opreorder(tc_nat))). % 0.12/0.38 cnf(i_0_93, plain, (class_Orderings_Olinorder(tc_nat))). % 0.12/0.38 cnf(i_0_94, plain, (class_Orderings_Oorder(tc_nat))). % 0.12/0.38 cnf(i_0_86, plain, (c_InductTermi_OIT(v_s____))). % 0.12/0.38 cnf(i_0_89, plain, (c_InductTermi_OIT(v_ta____))). % 0.12/0.38 cnf(i_0_91, negated_conjecture, (~c_InductTermi_OIT(v_s____))). % 0.12/0.38 cnf(i_0_88, plain, (c_InductTermi_OIT(c_Lambda_OdB_OVar(X1)))). % 0.12/0.38 cnf(i_0_85, plain, (c_Lambda_OdB_OVar(X2)!=c_Lambda_OdB_OAbs(X1))). % 0.12/0.38 cnf(i_0_81, plain, (c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OAbs(X2))). % 0.12/0.38 cnf(i_0_82, plain, (X1=X2|c_Lambda_OdB_OAbs(X1)!=c_Lambda_OdB_OAbs(X2))). % 0.12/0.38 cnf(i_0_84, plain, (X1=X2|c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OVar(X2))). % 0.12/0.38 cnf(i_0_90, plain, (c_InductTermi_OIT(c_Lambda_OdB_OAbs(X1))|~c_InductTermi_OIT(X1))). % 0.12/0.38 cnf(i_0_54, plain, (c_Lambda_OdB_OAbs(X1)!=c_Lambda_OdB_OApp(X2,X3))). % 0.12/0.38 cnf(i_0_71, plain, (c_Lambda_OdB_OVar(X1)!=c_Lambda_OdB_OApp(X2,X3))). % 0.12/0.38 cnf(i_0_53, plain, (c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OAbs(X3))). % 0.12/0.38 cnf(i_0_78, plain, (c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OVar(X3))). % 0.12/0.38 cnf(i_0_87, plain, (c_InductTermi_OIT(c_Lambda_Olift(X1,X2))|~c_InductTermi_OIT(X1))). % 0.12/0.38 cnf(i_0_58, plain, (X2=X4|c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OApp(X3,X4))). % 0.12/0.38 cnf(i_0_57, plain, (X1=X3|c_Lambda_OdB_OApp(X1,X2)!=c_Lambda_OdB_OApp(X3,X4))). % 0.12/0.38 cnf(i_0_79, plain, (c_InductTermi_OIT(c_Lambda_OdB_OApp(X1,c_Lambda_OdB_OVar(X2)))|~c_InductTermi_OIT(X1))). % 0.12/0.38 cnf(i_0_55, plain, (c_Lambda_Osubst(c_Lambda_OdB_OVar(X1),X2,X1)=X2)). % 0.12/0.38 cnf(i_0_77, plain, (c_Lambda_Osubst(c_Lambda_Olift(X1,X2),X3,X2)=X1)). % 0.12/0.38 cnf(i_0_69, plain, (~c_HOL_Oord__class_Oless(X1,X1,tc_nat))). % 0.12/0.38 cnf(i_0_70, plain, (~c_HOL_Oord__class_Oless(X1,X1,tc_nat))). % 0.12/0.38 cnf(i_0_66, plain, (~class_Orderings_Opreorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))). % 0.12/0.38 cnf(i_0_67, plain, (~class_Orderings_Olinorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))). % 0.12/0.38 cnf(i_0_68, plain, (~class_Orderings_Oorder(X1)|~c_HOL_Oord__class_Oless(X2,X2,X1))). % 0.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 cnf(i_0_83, plain, (c_InductTermi_OIT(c_Lambda_Osubst(X1,c_Lambda_OdB_OVar(X2),X3))|~c_InductTermi_OIT(X1))). % 0.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 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.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 2 steps % 0.12/0.38 cnf(i_0_91, negated_conjecture, (~c_InductTermi_OIT(v_s____)), inference(start_rule)). % 0.12/0.38 cnf(i_0_95, plain, (~c_InductTermi_OIT(v_s____)), inference(closure_rule, [i_0_86])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # NOT attempting initial tableau saturation % 0.12/0.38 # 1 start rule tableaux created. % 0.12/0.38 # 28 extension rule candidate clauses % 0.12/0.38 # 19 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------