%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX207+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 : n016.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 07:00:44 PM UTC 2026 % Result : Theorem 0.20s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX207+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.17/0.34 % Computer : n016.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue May 5 11:35:36 EDT 2026 % 0.17/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 27 Number of unprocessed: 27 % 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 # 27 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 26 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 1 extension rule candidate clauses % 0.20/0.37 # 26 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # There were 1 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 1 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 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/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_25, plain, (linP(pE)=nil)). % 0.20/0.37 cnf(i_0_5, plain, (proj1AP(aP(X1))=X1)). % 0.20/0.37 cnf(i_0_6, plain, (proj1BP(bP(X1))=X1)). % 0.20/0.37 cnf(i_0_19, plain, (append(nil,X1)=X1)). % 0.20/0.37 cnf(i_0_23, plain, (linP(pA)=cons(a,nil))). % 0.20/0.37 cnf(i_0_24, plain, (linP(pB)=cons(b,nil))). % 0.20/0.37 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 0.20/0.37 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 0.20/0.37 cnf(i_0_17, plain, (proj1C(c2(X1,X2))=X1)). % 0.20/0.37 cnf(i_0_18, plain, (proj2C(c2(X1,X2))=X2)). % 0.20/0.37 cnf(i_0_26, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.37 cnf(i_0_20, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.37 cnf(i_0_21, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.37 cnf(i_0_22, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.37 cnf(i_0_4, plain, (b!=a)). % 0.20/0.37 cnf(i_0_14, plain, (pB!=pA)). % 0.20/0.37 cnf(i_0_15, plain, (pE!=pA)). % 0.20/0.37 cnf(i_0_16, plain, (pE!=pB)). % 0.20/0.37 cnf(i_0_8, plain, (aP(X1)!=pA)). % 0.20/0.37 cnf(i_0_9, plain, (aP(X1)!=pB)). % 0.20/0.37 cnf(i_0_10, plain, (aP(X1)!=pE)). % 0.20/0.37 cnf(i_0_11, plain, (bP(X1)!=pA)). % 0.20/0.37 cnf(i_0_12, plain, (bP(X1)!=pB)). % 0.20/0.37 cnf(i_0_13, plain, (bP(X1)!=pE)). % 0.20/0.37 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 0.20/0.37 cnf(i_0_7, plain, (bP(X1)!=aP(X2))). % 0.20/0.37 cnf(i_0_27, negated_conjecture, (X1=X2|linC(X1)!=linC(X2))). % 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 5 steps % 0.20/0.37 cnf(i_0_27, negated_conjecture, (b=a|linC(b)!=linC(a)), inference(start_rule)). % 0.20/0.37 cnf(i_0_28, plain, (b=a), inference(closure_rule, [i_0_4])). % 0.20/0.37 cnf(i_0_29, plain, (linC(b)!=linC(a)), inference(extension_rule, [i_0_27])). % 0.20/0.37 cnf(i_0_31, plain, (linC(linC(b))!=linC(linC(a))), inference(extension_rule, [i_0_27])). % 0.20/0.37 cnf(i_0_33, plain, (linC(linC(linC(b)))!=linC(linC(linC(a)))), inference(etableau_closure_rule, [i_0_33, ...])). % 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 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 1 tableaux to operate on % 0.20/0.37 # Found closed tableau during pool population. % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------