%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEV631+1 : TPTP v9.3.0. Released v9.3.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 : n031.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 : Tue May 5 06:52:00 PM UTC 2026 % Result : Theorem 0.38s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEV631+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.17/0.35 % Computer : n031.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue May 5 06:29:08 EDT 2026 % 0.17/0.36 % CPUTime : % 0.38/0.58 # SinE strategy is gf120_h_gu_RUU_F100_L00500 % 0.38/0.58 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.38/0.58 # and selection function SelectNewComplexAHP. % 0.38/0.58 # % 0.38/0.58 # Presaturation interreduction done % 0.38/0.58 # Number of axioms: 39 Number of unprocessed: 38 % 0.38/0.58 # Tableaux proof search. % 0.38/0.58 # APR header successfully linked. % 0.38/0.58 # Hello from C++ % 0.38/0.58 # The folding up rule is enabled... % 0.38/0.58 # Local unification is enabled... % 0.38/0.58 # Any saturation attempts will use folding labels... % 0.38/0.58 # 38 beginning clauses after preprocessing and clausification % 0.38/0.58 # Creating start rules for all 8 conjectures. % 0.38/0.58 # There are 8 start rule candidates: % 0.38/0.58 # Found 11 unit axioms. % 0.38/0.58 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.38/0.58 # 8 start rule tableaux created. % 0.38/0.58 # 27 extension rule candidate clauses % 0.38/0.58 # 11 unit axiom clauses % 0.38/0.58 % 0.38/0.58 # Requested 8, 32 cores available to the main process. % 0.38/0.60 # There were 1 total branch saturation attempts. % 0.38/0.60 # There were 0 of these attempts blocked. % 0.38/0.60 # There were 0 deferred branch saturation attempts. % 0.38/0.60 # There were 0 free duplicated saturations. % 0.38/0.60 # There were 1 total successful branch saturations. % 0.38/0.60 # There were 0 successful branch saturations in interreduction. % 0.38/0.60 # There were 0 successful branch saturations on the branch. % 0.38/0.60 # There were 1 successful branch saturations after the branch. % 0.38/0.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.38/0.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.38/0.60 # Begin clausification derivation % 0.38/0.60 % 0.38/0.60 # End clausification derivation % 0.38/0.60 # Begin listing active clauses obtained from FOF to CNF conversion % 0.38/0.60 cnf(i_0_8, negated_conjecture, (ciT___24t(esk1_0))). % 0.38/0.60 cnf(i_0_7, negated_conjecture, (cCoq_2eInit_2eDatatypes_2elist___24t(ciT,esk2_0))). % 0.38/0.60 cnf(i_0_5, negated_conjecture, (cHList_2ehlist_2ehlist___24t(esk2_0,esk4_0))). % 0.38/0.60 cnf(i_0_3, negated_conjecture, (cHList_2ehlist_2ehlist___24t(esk2_0,esk6_0))). % 0.38/0.60 cnf(i_0_25, plain, (cType___24t(ciT))). % 0.38/0.60 cnf(i_0_6, negated_conjecture, (cF___24t(esk1_0,esk3_0))). % 0.38/0.60 cnf(i_0_4, negated_conjecture, (cF___24t(esk1_0,esk5_0))). % 0.38/0.60 cnf(i_0_32, plain, (cHList_2ehlist_2ehlist___24t(cCoq_2eInit_2eDatatypes_2enil___24a1(ciT),cHList_2ehlist_2eHnil))). % 0.38/0.60 cnf(i_0_2, negated_conjecture, (cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk5_0,esk6_0)=cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk3_0,esk4_0))). % 0.38/0.60 cnf(i_0_31, plain, (cHList_2ehlist_2eHcons___24a4(X1,X2,X3,X4)!=cHList_2ehlist_2eHnil)). % 0.38/0.60 cnf(i_0_34, plain, (cCoq_2eInit_2eDatatypes_2enil___24a1(X1)!=cCoq_2eInit_2eDatatypes_2econs___24a3(X2,X3,X4))). % 0.38/0.60 cnf(i_0_1, negated_conjecture, (esk5_0!=esk3_0|esk6_0!=esk4_0)). % 0.38/0.60 cnf(i_0_26, plain, (ciT___24t(X1)|~t(X1,ciT))). % 0.38/0.60 cnf(i_0_27, plain, (t(X1,ciT)|~ciT___24t(X1))). % 0.38/0.60 cnf(i_0_33, plain, (X1=cHList_2ehlist_2eHnil|~cHList_2ehlist_2ehlist___24t(cCoq_2eInit_2eDatatypes_2enil___24a1(ciT),X1))). % 0.38/0.60 cnf(i_0_35, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2enil___24a1(X1)!=cCoq_2eInit_2eDatatypes_2enil___24a1(X2))). % 0.38/0.60 cnf(i_0_18, plain, (X1=cHList_2ehlist_2eHnil|ciT___24t(esk7_2(X2,X1))|~cHList_2ehlist_2ehlist___24t(X2,X1)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X2))). % 0.38/0.60 cnf(i_0_17, plain, (X1=cHList_2ehlist_2eHnil|cCoq_2eInit_2eDatatypes_2elist___24t(ciT,esk8_2(X2,X1))|~cHList_2ehlist_2ehlist___24t(X2,X1)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X2))). % 0.38/0.60 cnf(i_0_30, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2econs___24a3(X3,X4,X1)!=cCoq_2eInit_2eDatatypes_2econs___24a3(X5,X6,X2))). % 0.38/0.60 cnf(i_0_29, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2econs___24a3(X3,X1,X4)!=cCoq_2eInit_2eDatatypes_2econs___24a3(X5,X2,X6))). % 0.38/0.60 cnf(i_0_28, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2econs___24a3(X1,X3,X4)!=cCoq_2eInit_2eDatatypes_2econs___24a3(X2,X5,X6))). % 0.38/0.60 cnf(i_0_24, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|ciT___24t(esk7_2(X1,X2))|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_23, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|cCoq_2eInit_2eDatatypes_2elist___24t(ciT,esk8_2(X1,X2))|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_12, plain, (X1=X2|cHList_2ehlist_2eHcons___24a4(X3,X4,X5,X1)!=cHList_2ehlist_2eHcons___24a4(X6,X7,X8,X2))). % 0.38/0.60 cnf(i_0_11, plain, (X1=X2|cHList_2ehlist_2eHcons___24a4(X3,X4,X1,X5)!=cHList_2ehlist_2eHcons___24a4(X6,X7,X2,X8))). % 0.38/0.60 cnf(i_0_10, plain, (X1=X2|cHList_2ehlist_2eHcons___24a4(X3,X1,X4,X5)!=cHList_2ehlist_2eHcons___24a4(X6,X2,X7,X8))). % 0.38/0.60 cnf(i_0_37, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(X2)|cCoq_2eInit_2eDatatypes_2elist___24t(X2,esk12_2(X2,X1))|~cCoq_2eInit_2eDatatypes_2elist___24t(X2,X1)|~cType___24t(X2))). % 0.38/0.60 cnf(i_0_38, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(X2)|t(esk11_2(X2,X1),X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(X2,X1)|~cType___24t(X2))). % 0.38/0.60 cnf(i_0_9, plain, (X1=X2|cHList_2ehlist_2eHcons___24a4(X1,X3,X4,X5)!=cHList_2ehlist_2eHcons___24a4(X2,X6,X7,X8))). % 0.38/0.60 cnf(i_0_15, plain, (X1=cHList_2ehlist_2eHnil|cHList_2ehlist_2ehlist___24t(esk8_2(X2,X1),esk10_2(X2,X1))|~cHList_2ehlist_2ehlist___24t(X2,X1)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X2))). % 0.38/0.60 cnf(i_0_16, plain, (X1=cHList_2ehlist_2eHnil|cF___24t(esk7_2(X2,X1),esk9_2(X2,X1))|~cHList_2ehlist_2ehlist___24t(X2,X1)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X2))). % 0.38/0.60 cnf(i_0_21, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|cHList_2ehlist_2ehlist___24t(esk8_2(X1,X2),esk10_2(X1,X2))|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_22, plain, (X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|cF___24t(esk7_2(X1,X2),esk9_2(X1,X2))|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_14, plain, (cCoq_2eInit_2eDatatypes_2econs___24a3(ciT,esk7_2(X1,X2),esk8_2(X1,X2))=X1|X2=cHList_2ehlist_2eHnil|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_20, plain, (cCoq_2eInit_2eDatatypes_2econs___24a3(ciT,esk7_2(X1,X2),esk8_2(X1,X2))=X1|X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_36, plain, (cCoq_2eInit_2eDatatypes_2econs___24a3(X1,esk11_2(X1,X2),esk12_2(X1,X2))=X2|X2=cCoq_2eInit_2eDatatypes_2enil___24a1(X1)|~cCoq_2eInit_2eDatatypes_2elist___24t(X1,X2)|~cType___24t(X1))). % 0.38/0.60 cnf(i_0_13, plain, (cHList_2ehlist_2eHcons___24a4(esk7_2(X1,X2),esk8_2(X1,X2),esk9_2(X1,X2),esk10_2(X1,X2))=X2|X2=cHList_2ehlist_2eHnil|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 cnf(i_0_19, plain, (cHList_2ehlist_2eHcons___24a4(esk7_2(X1,X2),esk8_2(X1,X2),esk9_2(X1,X2),esk10_2(X1,X2))=X2|X1=cCoq_2eInit_2eDatatypes_2enil___24a1(ciT)|~cHList_2ehlist_2ehlist___24t(X1,X2)|~cCoq_2eInit_2eDatatypes_2elist___24t(ciT,X1))). % 0.38/0.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.38/0.60 # Begin printing tableau % 0.38/0.60 # Found 4 steps % 0.38/0.60 cnf(i_0_2, negated_conjecture, (cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk5_0,esk6_0)=cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk3_0,esk4_0)), inference(start_rule)). % 0.38/0.60 cnf(i_0_43, plain, (cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk5_0,esk6_0)=cHList_2ehlist_2eHcons___24a4(esk1_0,esk2_0,esk3_0,esk4_0)), inference(extension_rule, [i_0_12])). % 0.38/0.60 cnf(i_0_80, plain, (esk6_0=esk4_0), inference(extension_rule, [i_0_1])). % 0.38/0.60 cnf(i_0_162, plain, (esk5_0!=esk3_0), inference(etableau_closure_rule, [i_0_162, ...])). % 0.38/0.60 # End printing tableau % 0.38/0.60 # SZS output end % 0.38/0.60 # Branches closed with saturation will be marked with an "s" % 0.38/0.60 # Child (16515) has found a proof. % 0.38/0.60 % 0.38/0.60 # Proof search is over... % 0.38/0.60 # Freeing feature tree %------------------------------------------------------------------------------