%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN516+1 : TPTP v8.1.0. Released v2.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 : n003.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 : Thu Jul 21 06:11:58 EDT 2022 % Result : CounterSatisfiable 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN516+1 : TPTP v8.1.0. Released v2.1.0. % 0.07/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 : n003.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 11 23:22:15 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y % 0.14/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 134 Number of unprocessed: 134 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 134 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 104 conjectures. % 0.14/0.38 # There are 104 start rule candidates: % 0.14/0.38 # Found 0 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 104 start rule tableaux created. % 0.14/0.38 # 134 extension rule candidate clauses % 0.14/0.38 # 0 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # 13867 Satisfiable branch % 0.20/0.40 # Satisfiable branch found. % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 0 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 0 successful branch saturations after the branch. % 0.20/0.40 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_98, negated_conjecture, (c5_0|epred1_0)). % 0.20/0.40 cnf(i_0_10, negated_conjecture, (ndr1_0|c1_0)). % 0.20/0.40 cnf(i_0_69, negated_conjecture, (ndr1_0|c3_0)). % 0.20/0.40 cnf(i_0_33, negated_conjecture, (ndr1_0|~c5_0)). % 0.20/0.40 cnf(i_0_12, negated_conjecture, (ndr1_0|~c2_0)). % 0.20/0.40 cnf(i_0_142, plain, (ndr1_0|~epred1_0)). % 0.20/0.40 cnf(i_0_74, negated_conjecture, (c5_0|~c4_0|~c2_0)). % 0.20/0.40 cnf(i_0_97, negated_conjecture, (ndr1_0|~c4_0|~c1_0)). % 0.20/0.40 cnf(i_0_8, negated_conjecture, (ndr1_0|c1_0|ndr1_1(a48))). % 0.20/0.40 cnf(i_0_9, negated_conjecture, (ndr1_0|c1_0|c4_1(a48))). % 0.20/0.40 cnf(i_0_63, negated_conjecture, (ndr1_0|c3_0|ndr1_1(a39))). % 0.20/0.40 cnf(i_0_68, negated_conjecture, (ndr1_0|c3_0|ndr1_1(a41))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (ndr1_0|c3_0|c2_1(a39))). % 0.20/0.40 cnf(i_0_137, plain, (ndr1_0|ndr1_1(a31)|~epred1_0)). % 0.20/0.40 cnf(i_0_141, plain, (ndr1_0|ndr1_1(a31)|~epred1_0)). % 0.20/0.40 cnf(i_0_32, negated_conjecture, (ndr1_0|ndr1_1(a44)|~c5_0)). % 0.20/0.40 cnf(i_0_27, negated_conjecture, (ndr1_0|c4_1(a44)|~c5_0)). % 0.20/0.40 cnf(i_0_122, plain, (ndr1_0|c3_1(a30)|~epred1_0)). % 0.20/0.40 cnf(i_0_28, negated_conjecture, (ndr1_0|c3_1(a44)|~c5_0)). % 0.20/0.40 cnf(i_0_133, plain, (ndr1_0|c1_1(a31)|~epred1_0)). % 0.20/0.40 cnf(i_0_96, negated_conjecture, (ndr1_1(a34)|~c4_0|~c1_0)). % 0.20/0.40 cnf(i_0_11, negated_conjecture, (~c2_0|~c3_1(a46))). % 0.20/0.40 cnf(i_0_5, negated_conjecture, (ndr1_0|c1_0|~c3_1(a47))). % 0.20/0.40 cnf(i_0_64, negated_conjecture, (ndr1_0|c3_0|~c2_1(a41))). % 0.20/0.40 cnf(i_0_19, negated_conjecture, (ndr1_0|~c5_0|~c2_1(a43))). % 0.20/0.40 cnf(i_0_26, negated_conjecture, (ndr1_0|~c5_0|~c5_1(a43))). % 0.20/0.40 cnf(i_0_132, plain, (ndr1_0|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_62, negated_conjecture, (c3_0|ndr1_1(a39)|ndr1_1(a41))). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (c3_0|ndr1_1(a41)|c2_1(a39))). % 0.20/0.40 cnf(i_0_92, negated_conjecture, (~c4_0|~c1_0|~c2_1(a34))). % 0.20/0.40 cnf(i_0_91, negated_conjecture, (~c4_0|~c1_0|~c1_1(a34))). % 0.20/0.40 cnf(i_0_117, plain, (ndr1_1(a31)|c3_1(a30)|~epred1_0)). % 0.20/0.40 cnf(i_0_121, plain, (ndr1_1(a31)|c3_1(a30)|~epred1_0)). % 0.20/0.40 cnf(i_0_113, plain, (c3_1(a30)|c1_1(a31)|~epred1_0)). % 0.20/0.40 cnf(i_0_3, negated_conjecture, (c1_0|ndr1_1(a48)|~c3_1(a47))). % 0.20/0.40 cnf(i_0_4, negated_conjecture, (c1_0|c4_1(a48)|~c3_1(a47))). % 0.20/0.40 cnf(i_0_58, negated_conjecture, (c3_0|ndr1_1(a39)|~c2_1(a41))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (c3_0|c2_1(a39)|~c2_1(a41))). % 0.20/0.40 cnf(i_0_127, plain, (ndr1_1(a31)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_131, plain, (ndr1_1(a31)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_18, negated_conjecture, (ndr1_1(a44)|~c5_0|~c2_1(a43))). % 0.20/0.40 cnf(i_0_25, negated_conjecture, (ndr1_1(a44)|~c5_0|~c5_1(a43))). % 0.20/0.40 cnf(i_0_13, negated_conjecture, (c4_1(a44)|~c5_0|~c2_1(a43))). % 0.20/0.40 cnf(i_0_20, negated_conjecture, (c4_1(a44)|~c5_0|~c5_1(a43))). % 0.20/0.40 cnf(i_0_14, negated_conjecture, (c3_1(a44)|~c5_0|~c2_1(a43))). % 0.20/0.40 cnf(i_0_21, negated_conjecture, (c3_1(a44)|~c5_0|~c5_1(a43))). % 0.20/0.40 cnf(i_0_123, plain, (c1_1(a31)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_65, negated_conjecture, (ndr1_0|c3_0|c4_2(a41,a42))). % 0.20/0.40 cnf(i_0_67, negated_conjecture, (ndr1_0|c3_0|c5_2(a41,a42))). % 0.20/0.40 cnf(i_0_57, negated_conjecture, (ndr1_0|c3_0|c1_2(a39,a40))). % 0.20/0.40 cnf(i_0_51, negated_conjecture, (ndr1_0|c3_0|c2_2(a39,a40))). % 0.20/0.40 cnf(i_0_140, plain, (ndr1_0|c3_2(a31,a32)|~epred1_0)). % 0.20/0.40 cnf(i_0_138, plain, (ndr1_0|c5_2(a31,a32)|~epred1_0)). % 0.20/0.40 cnf(i_0_31, negated_conjecture, (ndr1_0|c1_2(a44,a45)|~c5_0)). % 0.20/0.40 cnf(i_0_134, plain, (ndr1_0|c2_2(a31,a33)|~epred1_0)). % 0.20/0.40 cnf(i_0_95, negated_conjecture, (c1_2(a34,a35)|~c4_0|~c1_0)). % 0.20/0.40 cnf(i_0_59, negated_conjecture, (c3_0|ndr1_1(a39)|c4_2(a41,a42))). % 0.20/0.40 cnf(i_0_61, negated_conjecture, (c3_0|ndr1_1(a39)|c5_2(a41,a42))). % 0.20/0.40 cnf(i_0_56, negated_conjecture, (c3_0|ndr1_1(a41)|c1_2(a39,a40))). % 0.20/0.40 cnf(i_0_50, negated_conjecture, (c3_0|ndr1_1(a41)|c2_2(a39,a40))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (c3_0|c2_1(a39)|c4_2(a41,a42))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (c3_0|c2_1(a39)|c5_2(a41,a42))). % 0.20/0.40 cnf(i_0_120, plain, (c3_1(a30)|c3_2(a31,a32)|~epred1_0)). % 0.20/0.40 cnf(i_0_118, plain, (c3_1(a30)|c5_2(a31,a32)|~epred1_0)). % 0.20/0.40 cnf(i_0_114, plain, (c3_1(a30)|c2_2(a31,a33)|~epred1_0)). % 0.20/0.40 cnf(i_0_52, negated_conjecture, (c3_0|c1_2(a39,a40)|~c2_1(a41))). % 0.20/0.40 cnf(i_0_46, negated_conjecture, (c3_0|c2_2(a39,a40)|~c2_1(a41))). % 0.20/0.40 cnf(i_0_130, plain, (c3_2(a31,a32)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_128, plain, (c5_2(a31,a32)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_17, negated_conjecture, (c1_2(a44,a45)|~c5_0|~c2_1(a43))). % 0.20/0.40 cnf(i_0_24, negated_conjecture, (c1_2(a44,a45)|~c5_0|~c5_1(a43))). % 0.20/0.40 cnf(i_0_124, plain, (c2_2(a31,a33)|~epred1_0|~c1_1(a30))). % 0.20/0.40 cnf(i_0_73, negated_conjecture, (ndr1_1(X1)|c4_1(X1)|~ndr1_0|~c3_0|~c5_1(X1))). % 0.20/0.40 cnf(i_0_6, negated_conjecture, (ndr1_0|c1_0|~c5_2(a48,a49))). % 0.20/0.40 cnf(i_0_7, negated_conjecture, (ndr1_0|c1_0|~c1_2(a48,a49))). % 0.20/0.40 cnf(i_0_66, negated_conjecture, (ndr1_0|c3_0|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_30, negated_conjecture, (ndr1_0|~c5_0|~c4_2(a44,a45))). % 0.20/0.40 cnf(i_0_29, negated_conjecture, (ndr1_0|~c5_0|~c2_2(a44,a45))). % 0.20/0.40 cnf(i_0_139, plain, (ndr1_0|~epred1_0|~c4_2(a31,a32))). % 0.20/0.40 cnf(i_0_136, plain, (ndr1_0|~epred1_0|~c4_2(a31,a33))). % 0.20/0.40 cnf(i_0_135, plain, (ndr1_0|~epred1_0|~c5_2(a31,a33))). % 0.20/0.40 cnf(i_0_93, negated_conjecture, (~c4_0|~c1_0|~c4_2(a34,a35))). % 0.20/0.40 cnf(i_0_94, negated_conjecture, (~c4_0|~c1_0|~c5_2(a34,a35))). % 0.20/0.40 cnf(i_0_60, negated_conjecture, (c3_0|ndr1_1(a39)|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (c3_0|c2_1(a39)|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_119, plain, (c3_1(a30)|~epred1_0|~c4_2(a31,a32))). % 0.20/0.40 cnf(i_0_116, plain, (c3_1(a30)|~epred1_0|~c4_2(a31,a33))). % 0.20/0.40 cnf(i_0_115, plain, (c3_1(a30)|~epred1_0|~c5_2(a31,a33))). % 0.20/0.40 cnf(i_0_1, negated_conjecture, (c1_0|~c3_1(a47)|~c5_2(a48,a49))). % 0.20/0.40 cnf(i_0_2, negated_conjecture, (c1_0|~c3_1(a47)|~c1_2(a48,a49))). % 0.20/0.40 cnf(i_0_53, negated_conjecture, (c3_0|c4_2(a41,a42)|c1_2(a39,a40))). % 0.20/0.40 cnf(i_0_47, negated_conjecture, (c3_0|c4_2(a41,a42)|c2_2(a39,a40))). % 0.20/0.40 cnf(i_0_55, negated_conjecture, (c3_0|c5_2(a41,a42)|c1_2(a39,a40))). % 0.20/0.40 cnf(i_0_49, negated_conjecture, (c3_0|c5_2(a41,a42)|c2_2(a39,a40))). % 0.20/0.40 cnf(i_0_16, negated_conjecture, (~c5_0|~c2_1(a43)|~c4_2(a44,a45))). % 0.20/0.40 cnf(i_0_15, negated_conjecture, (~c5_0|~c2_1(a43)|~c2_2(a44,a45))). % 0.20/0.40 cnf(i_0_23, negated_conjecture, (~c5_0|~c5_1(a43)|~c4_2(a44,a45))). % 0.20/0.40 cnf(i_0_22, negated_conjecture, (~c5_0|~c5_1(a43)|~c2_2(a44,a45))). % 0.20/0.40 cnf(i_0_129, plain, (~epred1_0|~c1_1(a30)|~c4_2(a31,a32))). % 0.20/0.40 cnf(i_0_126, plain, (~epred1_0|~c1_1(a30)|~c4_2(a31,a33))). % 0.20/0.40 cnf(i_0_125, plain, (~epred1_0|~c1_1(a30)|~c5_2(a31,a33))). % 0.20/0.40 cnf(i_0_70, negated_conjecture, (c4_1(X1)|c3_2(X1,a38)|~ndr1_0|~c3_0|~c5_1(X1))). % 0.20/0.40 cnf(i_0_71, negated_conjecture, (c4_1(X1)|c1_2(X1,a38)|~ndr1_0|~c3_0|~c5_1(X1))). % 0.20/0.40 cnf(i_0_54, negated_conjecture, (c3_0|c1_2(a39,a40)|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_48, negated_conjecture, (c3_0|c2_2(a39,a40)|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_72, negated_conjecture, (c4_1(X1)|~ndr1_0|~c3_0|~c5_1(X1)|~c5_2(X1,a38))). % 0.20/0.40 cnf(i_0_39, negated_conjecture, (ndr1_0|c3_0|c1_2(a39,X1)|~ndr1_1(a39)|~c5_2(a39,X1))). % 0.20/0.40 cnf(i_0_38, negated_conjecture, (c3_0|ndr1_1(a41)|c1_2(a39,X1)|~ndr1_1(a39)|~c5_2(a39,X1))). % 0.20/0.40 cnf(i_0_34, negated_conjecture, (c3_0|c1_2(a39,X1)|~ndr1_1(a39)|~c2_1(a41)|~c5_2(a39,X1))). % 0.20/0.40 cnf(i_0_35, negated_conjecture, (c3_0|c1_2(a39,X1)|c4_2(a41,a42)|~ndr1_1(a39)|~c5_2(a39,X1))). % 0.20/0.40 cnf(i_0_37, negated_conjecture, (c3_0|c1_2(a39,X1)|c5_2(a41,a42)|~ndr1_1(a39)|~c5_2(a39,X1))). % 0.20/0.40 cnf(i_0_36, negated_conjecture, (c3_0|c1_2(a39,X1)|~ndr1_1(a39)|~c5_2(a39,X1)|~c3_2(a41,a42))). % 0.20/0.40 cnf(i_0_108, negated_conjecture, (c1_0|c4_2(X1,X2)|c2_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c4_1(X1)|~c5_2(X1,X2))). % 0.20/0.40 cnf(i_0_78, negated_conjecture, (ndr1_1(X1)|c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X2,a36)|~ndr1_0|~ndr1_1(X2))). % 0.20/0.40 cnf(i_0_109, negated_conjecture, (c4_0|c5_0|c3_2(X1,X2)|c5_2(X1,X2)|c4_2(X1,a27)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.20/0.40 cnf(i_0_86, negated_conjecture, (ndr1_1(X1)|c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~c5_2(X2,a36))). % 0.20/0.40 cnf(i_0_82, negated_conjecture, (ndr1_1(X1)|c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~c1_2(X2,a36))). % 0.20/0.40 cnf(i_0_76, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X2,a36)|c3_2(X1,a37)|~ndr1_0|~ndr1_1(X2))). % 0.20/0.40 cnf(i_0_77, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X2,a36)|c4_2(X1,a37)|~ndr1_0|~ndr1_1(X2))). % 0.20/0.40 cnf(i_0_110, negated_conjecture, (c4_0|c5_0|c3_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c5_2(X1,a27))). % 0.20/0.40 cnf(i_0_111, negated_conjecture, (c4_0|c5_0|c3_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c1_2(X1,a27))). % 0.20/0.40 cnf(i_0_75, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X2,a36)|~ndr1_0|~ndr1_1(X2)|~c2_2(X1,a37))). % 0.20/0.40 cnf(i_0_84, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X1,a37)|~ndr1_0|~ndr1_1(X2)|~c5_2(X2,a36))). % 0.20/0.40 cnf(i_0_80, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c3_2(X1,a37)|~ndr1_0|~ndr1_1(X2)|~c1_2(X2,a36))). % 0.20/0.40 cnf(i_0_85, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c4_2(X1,a37)|~ndr1_0|~ndr1_1(X2)|~c5_2(X2,a36))). % 0.20/0.40 cnf(i_0_81, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|c4_2(X1,a37)|~ndr1_0|~ndr1_1(X2)|~c1_2(X2,a36))). % 0.20/0.40 cnf(i_0_83, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~c5_2(X2,a36)|~c2_2(X1,a37))). % 0.20/0.40 cnf(i_0_79, negated_conjecture, (c4_1(X1)|c5_1(X2)|c5_1(X1)|c3_2(X2,X3)|c2_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~c1_2(X2,a36)|~c2_2(X1,a37))). % 0.20/0.40 cnf(i_0_105, negated_conjecture, (ndr1_1(X3)|c2_1(X3)|c3_1(X1)|c2_2(X1,a29)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2))). % 0.20/0.40 cnf(i_0_106, negated_conjecture, (ndr1_1(X3)|c2_1(X3)|c3_1(X1)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2)|~c1_2(X1,a29))). % 0.20/0.40 cnf(i_0_99, negated_conjecture, (c2_1(X3)|c3_1(X1)|c2_2(X1,a29)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2)|~c3_2(X3,a28))). % 0.20/0.40 cnf(i_0_102, negated_conjecture, (c2_1(X3)|c3_1(X1)|c2_2(X1,a29)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2)|~c5_2(X3,a28))). % 0.20/0.40 cnf(i_0_100, negated_conjecture, (c2_1(X3)|c3_1(X1)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2)|~c3_2(X3,a28)|~c1_2(X1,a29))). % 0.20/0.40 cnf(i_0_103, negated_conjecture, (c2_1(X3)|c3_1(X1)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c5_2(X1,X2)|~c1_2(X1,X2)|~c5_2(X3,a28)|~c1_2(X1,a29))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 3 steps % 0.20/0.40 cnf(i_0_9, negated_conjecture, (ndr1_0|c1_0|c4_1(a48)), inference(start_rule)). % 0.20/0.40 cnf(i_0_574, plain, (ndr1_0), inference(extension_rule, [i_0_103])). % 0.20/0.40 cnf(i_0_1769, plain, (c2_1(a41)), inference(extension_rule, [i_0_34])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Child (13867) has found a proof. % 0.20/0.40 % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------