%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.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 : n027.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 : Wed Jul 20 18:19:43 EDT 2022 % Result : Theorem 0.19s 0.41s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0. % 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n027.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Thu Jun 16 01:18:20 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 25 Number of unprocessed: 25 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 25 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 12 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 13 extension rule candidate clauses % 0.13/0.37 # 12 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 63 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 63 tableaux to operate on % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_24, plain, (p(a))). % 0.19/0.41 cnf(i_0_22, plain, (p(kk))). % 0.19/0.41 cnf(i_0_17, plain, (p(enc(tmk,pp)))). % 0.19/0.41 cnf(i_0_23, plain, (p(i(kk)))). % 0.19/0.41 cnf(i_0_3, plain, (i(i(X1))=X1)). % 0.19/0.41 cnf(i_0_18, plain, (p(enc(wk,w)))). % 0.19/0.41 cnf(i_0_21, plain, (p(enc(tc,k)))). % 0.19/0.41 cnf(i_0_20, plain, (p(enc(lp,t2)))). % 0.19/0.41 cnf(i_0_19, plain, (p(enc(w,t1)))). % 0.19/0.41 cnf(i_0_1, plain, (enc(i(X1),enc(X1,X2))=X2)). % 0.19/0.41 cnf(i_0_2, plain, (enc(X1,enc(i(X1),X2))=X2)). % 0.19/0.41 cnf(i_0_25, negated_conjecture, (~p(enc(pp,a)))). % 0.19/0.41 cnf(i_0_4, plain, (p(i(X1))|~p(X1))). % 0.19/0.41 cnf(i_0_16, plain, (p(enc(X1,X2))|~p(X3)|~p(X2)|~p(X1))). % 0.19/0.41 cnf(i_0_10, plain, (p(enc(tc,X1))|~p(X2)|~p(X3)|~p(X1))). % 0.19/0.41 cnf(i_0_11, plain, (p(enc(enc(i(tc),X1),X2))|~p(X3)|~p(X2)|~p(X1))). % 0.19/0.41 cnf(i_0_7, plain, (p(enc(wk,enc(i(tmk),X1)))|~p(X2)|~p(X3)|~p(X1))). % 0.19/0.41 cnf(i_0_12, plain, (p(enc(i(enc(i(tc),X1)),X2))|~p(X3)|~p(X2)|~p(X1))). % 0.19/0.41 cnf(i_0_8, plain, (p(enc(enc(i(tmk),X1),enc(i(tmk),X2)))|~p(X3)|~p(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_9, plain, (p(enc(enc(i(tmk),X1),enc(i(tc),X2)))|~p(X3)|~p(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_15, plain, (p(enc(enc(i(wk),X1),enc(i(lp),X2)))|~p(X3)|~p(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_5, plain, (p(enc(tmk,enc(i(enc(i(zcmk),X1)),X2)))|~p(X3)|~p(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_6, plain, (p(enc(i(enc(i(zcmk),X1)),enc(i(tmk),X2)))|~p(X3)|~p(X1)|~p(X2))). % 0.19/0.41 cnf(i_0_13, plain, (p(enc(enc(i(wk),X1),enc(i(enc(i(tmk),X2)),X3)))|~p(X1)|~p(X2)|~p(X3))). % 0.19/0.41 cnf(i_0_14, plain, (p(enc(enc(i(wk),X1),enc(i(enc(i(wk),X2)),X3)))|~p(X1)|~p(X2)|~p(X3))). % 0.19/0.41 cnf(i_0_127, plain, (X46=X46)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_24, plain, (p(a)), inference(start_rule)). % 0.19/0.41 cnf(i_0_134, plain, (p(a)), inference(extension_rule, [i_0_6])). % 0.19/0.41 cnf(i_0_236, plain, (~p(a)), inference(closure_rule, [i_0_24])). % 0.19/0.41 cnf(i_0_237, plain, (~p(a)), inference(closure_rule, [i_0_24])). % 0.19/0.41 cnf(i_0_235, plain, (p(enc(i(enc(i(zcmk),a)),enc(i(tmk),a)))), inference(extension_rule, [i_0_4])). % 0.19/0.41 cnf(i_0_262, plain, (p(i(enc(i(enc(i(zcmk),a)),enc(i(tmk),a))))), inference(etableau_closure_rule, [i_0_262, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (24670) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------