%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LDA003-1 : TPTP v8.1.0. Released v1.0.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 : n032.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 : Sun Jul 17 16:43:30 EDT 2022 % Result : Unsatisfiable 0.15s 0.33s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.10 % Problem : LDA003-1 : TPTP v8.1.0. Released v1.0.0. % 0.09/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.30 % Computer : n032.cluster.edu % 0.11/0.30 % Model : x86_64 x86_64 % 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.30 % Memory : 8042.1875MB % 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.30 % CPULimit : 300 % 0.11/0.30 % WCLimit : 600 % 0.11/0.30 % DateTime : Mon May 30 04:04:42 EDT 2022 % 0.11/0.30 % CPUTime : % 0.15/0.33 # No SInE strategy applied % 0.15/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.33 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.33 # % 0.15/0.33 # Presaturation interreduction done % 0.15/0.33 # Number of axioms: 7 Number of unprocessed: 7 % 0.15/0.33 # Tableaux proof search. % 0.15/0.33 # APR header successfully linked. % 0.15/0.33 # Hello from C++ % 0.15/0.33 # The folding up rule is enabled... % 0.15/0.33 # Local unification is enabled... % 0.15/0.33 # Any saturation attempts will use folding labels... % 0.15/0.33 # 7 beginning clauses after preprocessing and clausification % 0.15/0.33 # Creating start rules for all 1 conjectures. % 0.15/0.33 # There are 1 start rule candidates: % 0.15/0.33 # Found 6 unit axioms. % 0.15/0.33 # 1 start rule tableaux created. % 0.15/0.33 # 1 extension rule candidate clauses % 0.15/0.33 # 6 unit axiom clauses % 0.15/0.33 % 0.15/0.33 # Requested 8, 32 cores available to the main process. % 0.15/0.33 # There are not enough tableaux to fork, creating more from the initial 1 % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_12, plain, (f(n2,n1)=n3)). % 0.15/0.33 cnf(i_0_13, plain, (f(n2,n2)=u)). % 0.15/0.33 cnf(i_0_11, plain, (f(n1,n1)=n2)). % 0.15/0.33 cnf(i_0_9, plain, (left(X1,f(X1,X2)))). % 0.15/0.33 cnf(i_0_8, plain, (f(f(X1,X2),f(X1,X3))=f(X1,f(X2,X3)))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (~left(n3,u))). % 0.15/0.33 cnf(i_0_10, plain, (left(X1,X2)|~left(X3,X2)|~left(X1,X3))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_14, negated_conjecture, (~left(n3,u)), inference(start_rule)). % 0.15/0.33 cnf(i_0_15, plain, (~left(n3,u)), inference(extension_rule, [i_0_10])). % 0.15/0.33 cnf(i_0_18, plain, (~left(n3,f(n3,X7))), inference(closure_rule, [i_0_9])). % 0.15/0.33 cnf(i_0_17, plain, (~left(f(n3,X7),u)), inference(extension_rule, [i_0_10])). % 0.15/0.33 cnf(i_0_21, plain, (~left(f(n3,X7),f(f(n3,X7),X2))), inference(closure_rule, [i_0_9])). % 0.15/0.33 cnf(i_0_20, plain, (~left(f(f(n3,X7),X2),u)), inference(etableau_closure_rule, [i_0_20, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.15/0.33 # We now have 1 tableaux to operate on % 0.15/0.33 # Found closed tableau during pool population. % 0.15/0.33 # Proof search is over... % 0.15/0.33 # Freeing feature tree %------------------------------------------------------------------------------